Reconfiguring minimum dominating sets in trees

DOI10.7155/JGAA.00517MaRDI QIDQ5216280zbMATH OpenOpenAlexFDO

Authors Magdalena Lemańska, Paweł Żyliński

Publication date 17 February 2020

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

diameter of \(\gamma\)-graphsreconfiguration graphs

Mathematics Subject Classification ID

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

Recommendations

• Reconfiguring minimum dominating sets: the -graph of a tree
• Gamma graphs of some special classes of trees
• Reconfiguration graphs for dominating sets

Cites work

• -graphs of graphs
• A note on -graphs
• A note on some variations of the -graph
• Connected \(k\)-dominating graphs
• Gamma graphs of some special classes of trees
• scientific article; zbMATH DE number 5717232 (Why is no real title available?)
• On the corona of two graphs
• On the structure of dominating graphs
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Reconfiguring minimum dominating sets: the -graph of a tree
• The \(k\)-dominating graph
• The complexity of dominating set reconfiguration
• The gamma graph of a graph
• The maximum number of minimal dominating sets in a tree

Cited in

(3)

• Reconfiguring minimum dominating sets: the -graph of a tree
• Reconstructing a minimum spanning tree after deletion of any node
• A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences

This page was built for publication: Reconfiguring minimum dominating sets in trees

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