On k-Total Dominating Graphs
From MaRDI portal
Publication:5377032
zbMath1411.05196arXiv1711.04363MaRDI QIDQ5377032
David Fatehi, Saeid Alikhani, Christina M. Mynhardt
Publication date: 23 May 2019
Full work available at URL: https://arxiv.org/abs/1711.04363
Related Items (4)
On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ γ-Paired dominating graphs of lollipop, umbrella and coconut graphs ⋮ On k-Total Dominating Graphs ⋮ Reconfiguration graphs for dominating sets
Cites Work
- Unnamed Item
- Classifying coloring graphs
- Reconfiguration of dominating sets
- A new lower bound for the total domination number in graphs proving a Graffiti.pc conjecture
- The complexity of dominating set reconfiguration
- On the complexity of reconfiguration problems
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Connected \(k\)-dominating graphs
- The \(k\)-dominating graph
- Reconfiguring dominating sets in some well-covered and other classes of graphs
- On the structure of dominating graphs
- Connectedness of the graph of vertex-colourings
- Finding paths between 3-colorings
- Reconfiguration of List Edge-Colorings in a Graph
- Total domination in graphs
- Upper total domination in claw‐free graphs
- On k-Total Dominating Graphs
- Upper total domination versus upper paired-domination
This page was built for publication: On k-Total Dominating Graphs
