Uniform length dominating sequence graphs
From MaRDI portal
Publication:2657052
DOI10.1007/s00373-020-02221-5zbMath1459.05237arXiv1903.01324OpenAlexW3095455654MaRDI QIDQ2657052
Publication date: 17 March 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.01324
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Graphs with equal Grundy domination and independence number ⋮ Computation of Grundy dominating sequences in (co-)bipartite graphs ⋮ On graphs all of whose total dominating sequences have the same length
Cites Work
- Total dominating sequences in graphs
- Total version of the domination game
- Dominating sequences in graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Zero forcing number, Grundy domination number, and their variants
- Effect of predomination and vertex removal on the game total domination number of a graph
- Grundy dominating sequences and zero forcing sets
- The variety of domination games
- Realizations of the game domination number
- Game total domination for cyclic bipartite graphs
- Domination Game and an Imagination Strategy
- Extremal Problems for Game Domination Number
