The \(k\)-dominating graph

DOI10.1007/s00373-013-1302-3zbMath1294.05122arXiv1209.5138MaRDI QIDQ2014712

Ruth Haas, Karen Seyffarth

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.5138

zbMATH Keywords

bipartite graphs; chordal graphs; domination; reconfiguration problems

Mathematics Subject Classification ID

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

Related Items

Unnamed Item, Unnamed Item, γ-paired dominating graphs of cycles, Reconfiguring Minimum Dominating Sets in Trees, Reconfiguring vertex colourings of 2-trees, On k-Total Dominating Graphs, Semitotal domination in claw-free cubic graphs, Unnamed Item, On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets, γ-induced-paired dominating graphs of paths and cycles, γ-Paired dominating graphs of lollipop, umbrella and coconut graphs, Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters, Linear transformations between dominating sets in the TAR-model, Classifying coloring graphs, Reconfiguration of dominating sets, Eternal domination: criticality and reachability, The complexity of dominating set reconfiguration, On the parameterized complexity of reconfiguration problems, On the parameterized complexity of reconfiguration of connected dominating sets, Connected \(k\)-dominating graphs, Reconfiguring minimum dominating sets: the \(\gamma\)-graph of a tree, Reconfiguration on nowhere dense graph classes, Reconfiguration graphs of shortest paths, Dominating sets reconfiguration under token sliding, Reconfiguring dominating sets in minor-closed graph classes, Reconfiguration graphs for dominating sets, Irredundance graphs, Hamilton paths in dominating graphs of trees and cycles, TS-reconfiguration of dominating sets in circle and circular-arc graphs, Introduction to reconfiguration, Gamma graphs of some special classes of trees, Reconfiguring dominating sets in some well-covered and other classes of graphs, On the structure of dominating graphs, Reconfiguration of maximum-weight \(b\)-matchings in a graph, Irredundance trees of diameter 3, The Complexity of Dominating Set Reconfiguration

Cites Work

• Unnamed Item
• Unnamed Item
• On the complexity of reconfiguration problems
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• Chordal graphs and upper irredundance, upper domination and independence
• Connectedness of the graph of vertex-colourings
• Normal hypergraphs and the perfect graph conjecture
• The canonical coloring graph of trees and cycles
• Finding paths between 3-colorings
• γ-graphs of graphs
• Gray code numbers for graphs
• Reconfiguration of List Edge-Colorings in a Graph