On the number of cut-vertices in a graph

Glenn Hopkins and William Staton

International Journal of Mathematics and Mathematical Sciences, 1989, vol. 12, 1-4

Abstract:

A connected graph with n vertices contains no more than r 2 r-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.

Date: 1989
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/12/525972.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/12/525972.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:525972

DOI: 10.1155/S0161171289000359

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().