Bounds on the leaf number in graphs of girth 4 or 5

DOI10.1080/09720529.2020.1766761MaRDI QIDQ5035782zbMATH OpenOpenAlexFDO

Authors Phillip Mafuta

Publication date 22 February 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2020.1766761

zbMATH Keywords

minimum degreediameterorderleaf number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Distance in graphs (05C12)

Recommendations

• Bounds of the number of leaves of spanning trees in graphs without triangles
• Lower bounds on the number of leaves in spanning trees
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Bounds of the number of leaves of spanning trees
• Radius, leaf number, connected domination number and minimum degree

Cites work

• scientific article; zbMATH DE number 5079858 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Arbres avec un nombre maximum de sommets pendants
• Claw-free graphs---a survey
• Connected Domination and Spanning Trees with Many Leaves
• Constructing full spanning trees for cubic graphs
• Hamiltonicity, minimum degree and leaf number
• Leaf number and Hamiltonian \(C_4\)-free graphs
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Minimal spanning trees with a constraint on the number of leaves
• Minimum degree, leaf number, and hamiltonicity
• On minimum degree, leaf number, traceability and Hamiltonicity in graphs
• On spanning cycles, paths and trees
• Spanning Trees with Many Leaves
• Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
• Spanning paths and cycles in triangle-free graphs
• Spanning paths in graphs
• Spanning trees in graphs of minimum degree 4 or 5
• Spanning trees with many leaves
• Spanning trees with many leaves and average distance
• Spanning trees with many leaves in cubic graphs
• Spanning trees: A survey
• Transversal numbers of uniform hypergraphs

Cited in

(6)

• A note on connected domination number and leaf number
• Degree Distance in Graphs with Forbidden Subgraphs
• Average distance and connected domination
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• On a conjecture by Griggs, Kleitman and Shastri
• Radius, leaf number, connected domination number and minimum degree

This page was built for publication: Bounds on the leaf number in graphs of girth 4 or 5

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5035782)