Reconfiguring dominating sets in some well-covered and other classes of graphs

DOI10.1016/j.disc.2017.03.007zbMath1362.05097OpenAlexW2605510696MaRDI QIDQ2397524

Ruth Haas, Karen Seyffarth

Publication date: 22 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.007

zbMATH Keywords

independent setsgraph dominationreconfiguration problems

Mathematics Subject Classification ID

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

Related Items (11)

Connected \(k\)-dominating graphs ⋮ Irredundance trees of diameter 3 ⋮ 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 ⋮ Linear transformations between dominating sets in the TAR-model ⋮ On k-Total Dominating Graphs ⋮ Reconfiguring Minimum Dominating Sets in Trees ⋮ Reconfiguring vertex colourings of 2-trees ⋮ Reconfiguration graphs for dominating sets ⋮ Irredundance graphs ⋮ Introduction to reconfiguration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconfiguration of dominating sets
• Triangulations and equality in the domination chain
• On the complexity of reconfiguration problems
• A note on graphs which have upper irredundance equal to independence
• Reconfiguration of list edge-colorings in a graph
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• A characterization of well covered graphs of girth 5 or greater
• The \(k\)-dominating graph
• Connectedness of the graph of vertex-colourings
• Gray code numbers for graphs
• A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles
• Reconfiguring k-colourings of Complete Bipartite Graphs
• Some covering concepts in graphs

This page was built for publication: Reconfiguring dominating sets in some well-covered and other classes of graphs