Affiliation:
1. Department of Mathematics, University of Mississippi, University 38677, MS, USA
Abstract
A connected graph with n vertices contains no more thanr2r-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.
Subject
Mathematics (miscellaneous)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献