A note on connected domination number and leaf number

DOI10.1016/J.DISC.2022.113228MaRDI QIDQ2099474zbMATH OpenOpenAlexFDO

Authors Simon Mukwembi, Phillip Mafuta, B. G. 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

zbMATH Keywords

minimum degreeorderconnected domination numberleaf number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Recommendations

• Size, Order, and Connected Domination
• Making a dominating set of a graph connected
• Radius, leaf number, connected domination number and minimum degree
• A proof of a conjecture on the connected domination number
• Connected Domination and Spanning Trees with Many Leaves

Cites work

• scientific article; zbMATH DE number 3702724 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• Arbres avec un nombre maximum de sommets pendants
• Bounds on the connected domination number of a graph
• Bounds on the leaf number in graphs of girth 4 or 5
• Connected Domination and Spanning Trees with Many Leaves
• Constructing full spanning trees for cubic graphs
• Domination in Graphs Applied to Electric Power Networks
• Domination, radius, and minimum degree
• Hamiltonicity, minimum degree and leaf number
• Lower bounds on the leaf number in graphs with forbidden subgraphs
• Minimum degree, leaf number, and hamiltonicity
• On the minimum leaf number of cubic graphs
• Radius, leaf number, connected domination number and minimum degree
• 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 trees in graphs of minimum degree 4 or 5
• Spanning trees with many leaves in cubic graphs
• Spanning trees: A survey
• Transversal numbers of uniform hypergraphs

Cited in

(2)

• A proof of a conjecture on the connected domination number
• Radius, leaf number, connected domination number and minimum degree

This page was built for publication: A note on connected domination number and leaf number

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