Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
From MaRDI portal
Publication:1649910
DOI10.7151/dmgt.2044zbMath1391.05196OpenAlexW2792562775MaRDI QIDQ1649910
Gary MacGillivray, Michelle Edwards, Shahla Nasserasr
Publication date: 29 June 2018
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2044
Related Items (4)
A short note on the existence of infinite sequences of \(\gamma \)-graphs of graphs ⋮ \(\gamma\)-graphs of trees ⋮ Reconfiguring Minimum Dominating Sets in Trees ⋮ Reconfiguration graphs for dominating sets
Cites Work
- Unnamed Item
- Unnamed Item
- Reconfiguration of dominating sets
- The gamma graph of a graph
- On the complexity of reconfiguration problems
- A note on \(\gamma\)-graphs
- Weakly transitive orientations, Hasse diagrams and string graphs
- The \(k\)-dominating graph
- The complexity of change
- γ-graphs of graphs
- The Complexity of Dominating Set Reconfiguration
This page was built for publication: Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
