Article contents
Heawood's theorem and connectivity
Published online by Cambridge University Press: 26 February 2010
Extract
Let G be a finite connected graph with no loops or multiple edges. The point-connectivity K(G) of G is the minimum number of points whose removal results in a disconnected or trivial graph. Similarly, the line-connectivity λ(G) of G is the minimum number of lines whose removal results in a disconnected or trivial graph. For the complete graph Kp we have
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 1973
References
- 6
- Cited by