Reconfiguring Minimum Dominating Sets in Trees

DOI10.7155/jgaa.00517zbMath1433.05248OpenAlexW3005245438MaRDI QIDQ5216280

Paweł Żyliński, Magdalena Lemańska

Publication date: 17 February 2020

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00517

zbMATH Keywords

reconfiguration graphsdiameter of \(\gamma\)-graphs

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Reconfiguration of dominating sets
• The complexity of dominating set reconfiguration
• The gamma graph of a graph
• A note on \(\gamma\)-graphs
• Connected \(k\)-dominating graphs
• Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
• The \(k\)-dominating graph
• Gamma graphs of some special classes of trees
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• On the structure of dominating graphs
• On the corona of two graphs
• γ-graphs of graphs
• A note on some variations of the $\gamma$-graph
• The Maximum Number of Minimal Dominating Sets in a Tree

This page was built for publication: Reconfiguring Minimum Dominating Sets in Trees