Connected \(k\)-dominating graphs

DOI10.1016/j.disc.2018.09.006zbMath1400.05177arXiv1708.05458OpenAlexW2963285256MaRDI QIDQ1618230

R. Smith

Publication date: 13 November 2018

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

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

zbMATH Keywords

\(k\)-dominating graphdomination reconfiguration problem

Mathematics Subject Classification ID

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

Related Items (9)

Irredundance trees of diameter 3 ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ γ-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 ⋮ On k-Total Dominating Graphs ⋮ Reconfiguring Minimum Dominating Sets in Trees ⋮ Reconfiguration graphs for dominating sets ⋮ Irredundance graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Reconfiguration of dominating sets
• On the complexity of reconfiguration problems
• Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
• The \(k\)-dominating graph
• Reconfiguring dominating sets in some well-covered and other classes of graphs
• Connectedness of the graph of vertex-colourings
• Finding paths between 3-colorings
• Reconfiguration of List Edge-Colorings in a Graph

This page was built for publication: Connected \(k\)-dominating graphs