Radius, leaf number, connected domination number and minimum degree
From MaRDI portal
Publication:6110370
DOI10.2989/16073606.2022.2050958zbMath1517.05036OpenAlexW4223487746MaRDI QIDQ6110370
Simon Mukwembi, Phillip Mafuta, Sheunesu Munyira
Publication date: 5 July 2023
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2022.2050958
Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On size, order, diameter and minimum degree
- Minimum degree, edge-connectivity and radius
- Spanning trees: A survey
- Arbres avec un nombre maximum de sommets pendants
- Maximum induced trees in graphs
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- Radius, diameter, and minimum degree
- Minimal spanning trees with a constraint on the number of leaves
- Claw-free graphs---a survey
- Hamiltonicity, minimum degree and leaf number
- Graphs with forbidden subgraphs and leaf number
- Spanning paths in graphs
- Transversal numbers of uniform hypergraphs
- On spanning cycles, paths and trees
- Diameter and inverse degree
- Spanning trees with many leaves in cubic graphs
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- The average distance and the independence number
- Connected Domination and Spanning Trees with Many Leaves
- Minimum Degree, Leaf Number, and Hamiltonicity
- Average distance, minimum degree, and spanning trees
- Bounds on the leaf number in graphs of girth 4 or 5
- Spanning paths and cycles in triangle-free graphs
- Lower bounds on the leaf number in graphs with forbidden subgraphs
- Spanning trees with many leaves
This page was built for publication: Radius, leaf number, connected domination number and minimum degree
