On the number of cut-vertices in a graph
A connected graph with n vertices contains no more than r2r-2(n-2) cutvertices of degree r. All graphs in which the bound is achieved are described. In addition, for graphs of maximum degree three and minimum δ, best possible bounds are obtained for δ=1, 2, 3.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1989-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Online Access: | http://dx.doi.org/10.1155/S0161171289000359 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|