Reconfiguration graphs for dominating sets
From MaRDI portal
Publication:2073197
DOI10.1007/978-3-030-77983-2_6zbMath1482.05246OpenAlexW3204791468MaRDI QIDQ2073197
Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Heather C. Smith, K. V. Adaricheva, Karen Seyffarth
Publication date: 1 February 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-77983-2_6
Related Items (2)
On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying coloring graphs
- Reconfiguration of dominating sets
- The complexity of dominating set reconfiguration
- On the parameterized complexity of reconfiguration problems
- A note on \(\gamma\)-graphs
- Connected \(k\)-dominating graphs
- Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
- Reconfiguration on sparse graphs
- The \(k\)-dominating graph
- Introduction to reconfiguration
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- On the structure of dominating graphs
- Connectedness of the graph of vertex-colourings
- γ-graphs of graphs
- Gray code numbers for graphs
- A note on some variations of the $\gamma$-graph
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- Reconfiguring vertex colourings of 2-trees
- Reconfiguring k-colourings of Complete Bipartite Graphs
- On k-Total Dominating Graphs
- Linear transformations between dominating sets in the TAR-model
This page was built for publication: Reconfiguration graphs for dominating sets
