Graphs with few total dominating sets

DOI10.1016/j.disc.2018.01.006zbMath1380.05152OpenAlexW2791029341MaRDI QIDQ1699541

Peng Zhang

Publication date: 23 February 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2018.01.006

zbMATH Keywords

lower boundtotal domination numbertotal dominating setsubdivided star

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Toward a Nordhaus-Gaddum inequality for the number of dominating sets ⋮ Trees with minimum number of infima closed sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fibonacci index and stability number of graphs: a polyhedral study
• Trees having many minimal dominating sets
• Majorization and the minimum number of dominating sets
• Problems related to graph indices in trees
• Total domination in graphs
• Total Domination in Graphs
• Minimal 2-dominating sets in trees

This page was built for publication: Graphs with few total dominating sets