A note on connected domination number and leaf number
From MaRDI portal
Publication:2099474
DOI10.1016/j.disc.2022.113228zbMath1504.05220OpenAlexW4307958165MaRDI QIDQ2099474
Simon Mukwembi, Phillip Mafuta, Bernardo Gabriel Rodrigues
Publication date: 23 November 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2022.113228
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spanning trees: A survey
- Arbres avec un nombre maximum de sommets pendants
- Domination, radius, and minimum degree
- Constructing full spanning trees for cubic graphs
- Spanning trees in graphs of minimum degree 4 or 5
- Hamiltonicity, minimum degree and leaf number
- Transversal numbers of uniform hypergraphs
- On the minimum leaf number of cubic graphs
- Bounds on the connected domination number of a graph
- Spanning trees with many leaves in cubic graphs
- Spanning Trees with Many Leaves
- Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
- Connected Domination and Spanning Trees with Many Leaves
- Domination in Graphs Applied to Electric Power Networks
- Minimum Degree, Leaf Number, and Hamiltonicity
- 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
- Radius, leaf number, connected domination number and minimum degree
This page was built for publication: A note on connected domination number and leaf number
