Now showing items 1-1 of 1
Minimum degree, leaf number and traceability
(Institute of Mathematics of the Czech Academy of Sciences, 2013-03-26)
Let G be a finite connected graph with minimum degree δ. The leaf number L (G) of G is defined as the maximum number of leaf vertices contained in a spanning tree of G. We prove that if δ >12(L (G) + 1), then G is 2-connected. ...