The number of total dominating sets in binary trees

DOI10.61091/JCMCC125-15MaRDI QIDQ6950931zbMATH OpenFDO

Authors Opeyemi Oyewumi, Adriana Roux, Stephan Wagner

Publication date 30 July 2025

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/JCMCC125-15

zbMATH Keywords

binary treetotal dominating set

Mathematics Subject Classification ID

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

Cites work

• -graphs of graphs
• A note on the number of dominating sets of a graph
• Binary trees with the largest number of subtrees
• Graphs with few total dominating sets
• Majorization and the minimum number of dominating sets
• On the maximum number of minimum dominating sets in forests
• On the maximum number of minimum total dominating sets in forests
• On the number of independent subsets in trees with restricted degrees
• On the number of minimal dominating sets including the set of leaves in trees
• Total domination in graphs
• Trees having many minimal dominating sets
• Trees with extremal numbers of dominating sets
• Trees with large total domination number
• Trees with unique minimum total dominating sets

Cited in

(3)

• Binary trees with extremal number of maximal independent sets
• The number of dominating sets in d-ary trees
• Paired-domination in binary trees

This page was built for publication: The number of total dominating sets in binary trees

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