Graphs with equal Grundy domination and independence number
From MaRDI portal
Publication:6108929
DOI10.1016/j.disopt.2023.100777zbMath1514.05117arXiv2212.01335OpenAlexW4378651649MaRDI QIDQ6108929
Boštjan Brešar, Douglas F. Rall, Kirsti Kuenzel, Gábor Bacsó
Publication date: 30 June 2023
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.01335
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Total dominating sequences in graphs
- Dominating sequences in grid-like and toroidal graphs
- Dominating sequences in graphs
- Grundy dominating sequences on \(X\)-join product
- Grundy domination of forests and the strong product conjecture
- On minimum rank and zero forcing sets of a graph
- Contributions to the theory of domination, independence and irredundance in graphs
- Zero forcing number, Grundy domination number, and their variants
- Grundy dominating sequences and zero forcing sets
- An integer programming approach for solving a generalized version of the Grundy domination number
- On graphs all of whose total dominating sequences have the same length
- On graphs with equal total domination and Grundy total domination numbers
- Zero forcing sets and the minimum rank of graphs
- Uniform length dominating sequence graphs
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Grundy domination and zero forcing in Kneser graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Domination Games Played on Graphs
This page was built for publication: Graphs with equal Grundy domination and independence number
