Trees with extremal numbers of \(k\)-dominating sets

DOI10.1016/j.disc.2021.112656zbMath1476.05160OpenAlexW3202124097MaRDI QIDQ2237230

Dmitriy S. Taletskii

Publication date: 27 October 2021

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

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

zbMATH Keywords

treecountingindependent set\(k\)-dominating set

Mathematics Subject Classification ID

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

Related Items (2)

On the number of minimum dominating sets in trees ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent sets in graphs
• On the maximum number of minimum dominating sets in forests
• Almost all trees have an even number of independent sets
• Maximizing the number of independent subsets over trees with bounded degree
• Minimal 2-dominating sets in trees

This page was built for publication: Trees with extremal numbers of \(k\)-dominating sets