On the structure of dominating graphs
From MaRDI portal
Publication:2409507
DOI10.1007/s00373-017-1792-5zbMath1371.05206arXiv1512.07514OpenAlexW2963638145MaRDI QIDQ2409507
Saeid Alikhani, Davood Fatehi, Sandi Klavžar
Publication date: 11 October 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.07514
Graph polynomials (05C31) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Irredundance trees of diameter 3 ⋮ On dominating graph of graphs, median graphs, partial cubes and complement of minimal dominating sets ⋮ On k-Total Dominating Graphs ⋮ Reconfiguring Minimum Dominating Sets in Trees ⋮ Reconfiguring dominating sets in minor-closed graph classes ⋮ Reconfiguration graphs for dominating sets ⋮ Irredundance graphs ⋮ Introduction to reconfiguration
Cites Work
- Unnamed Item
- Unnamed Item
- Improved upper bounds on the domination number of graphs with minimum degree at least five
- Reconfiguration of dominating sets
- The domination polynomial of a graph at \(-1\)
- Complete \(r\)-partite graphs determined by their domination polynomial
- The \(k\)-dominating graph
- Domination game on forests
- Domination Game and an Imagination Strategy
- γ-graphs of graphs
- The Complexity of Dominating Set Reconfiguration
- Domination in graphs with minimum degree two
- DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR
- Dominatind sets and domination polynomials of certain graphs. II
- Paths, Stars and the Number Three
- Introduction to Domination Polynomial of a Graph
This page was built for publication: On the structure of dominating graphs