Bounds on the leaf number in graphs of girth 4 or 5
P. Mafuta · Journal of Discrete Mathematical Sciences and Cryptography · 2020
Here, we prove new asymptotically sharp lower bounds on the leaf number in graphs of girth at least 4 or 5. The results imply upper bounds on the diameter of the aforementioned classes of graphs. In addition, we apply the dead leaves method to produce a short, unified, alternate proof to one of the results by Bonsma. We consider simple graphs only unless otherwise specified.