Reconfiguration graphs for dominating sets

DOI10.1007/978-3-030-77983-2_6MaRDI QIDQ2073197zbMATH OpenOpenAlexFDO

Authors Kira Adaricheva, Chassidy Bozeman, Nancy E. Clarke, Ruth Haas, Margaret-Ellen Messinger, Heather Smith, K. Seyffarth

Publication date 1 February 2022

Full work available at URL https://doi.org/10.1007/978-3-030-77983-2_6

zbMATH Keywords

dominationreconfigurationdominating graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Reconfiguring dominating sets in some well-covered and other classes of graphs
• scientific article; zbMATH DE number 7272506
• The complexity of dominating set reconfiguration
• The complexity of dominating set reconfiguration
• Reconfiguring dominating sets in minor-closed graph classes
• On the parameterized complexity of reconfiguration of connected dominating sets
• scientific article; zbMATH DE number 7764115
• Reconfiguration graphs of zero forcing sets

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7272506 (Why is no real title available?)
• A note on \(\gamma\)-graphs
• A note on some variations of the \(\gamma\)-graph
• Classifying coloring graphs
• Connected \(k\)-dominating graphs
• Connectedness of the graph of vertex-colourings
• Graph theory
• Gray code numbers for graphs
• Introduction to reconfiguration
• Linear transformations between dominating sets in the TAR-model
• On k-Total Dominating Graphs
• On the structure of dominating graphs
• Reconfiguring \(k\)-colourings of complete bipartite graphs
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
• Reconfiguring vertex colourings of 2-trees
• The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
• The \(k\)-dominating graph
• The complexity of dominating set reconfiguration
• \(\gamma\)-graphs of graphs

Cited in

(16)

• Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters
• On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets
• Domination inequalities and dominating graphs
• Dominating sets reconfiguration under token sliding
• Reconfiguration on nowhere dense graph classes
• Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree
• Minimum separator reconfiguration
• Reconfiguring minimum dominating sets in trees
• On the structure of dominating graphs
• Reconfiguration graphs of zero forcing sets
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Reconfigurations in Graphs and Grids
• The \(k\)-dominating graph
• Reconfiguration of connected graph partitions via recombination
• Decremental Optimization of Dominating Sets Under the Reconfiguration Framework
• Reconfiguration of graphs with connectivity constraints

This page was built for publication: Reconfiguration graphs for dominating sets

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