The \(k\)-dominating graph

DOI10.1007/s00373-013-1302-3zbMath1294.05122arXiv1209.5138OpenAlexW1973079746MaRDI 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 graphschordal graphsdominationreconfiguration problems

Mathematics Subject Classification ID

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

Related Items (36)

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

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

This page was built for publication: The \(k\)-dominating graph