An integer programming approach for solving a generalized version of the Grundy domination number
From MaRDI portal
Publication:2032968
DOI10.1016/j.dam.2021.05.025zbMath1466.05160arXiv1912.12752OpenAlexW3167144882MaRDI QIDQ2032968
Daniel Severín, Manoel B. Campêlo
Publication date: 14 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.12752
integer programmingtabu searchGrundy total domination numberKneser graphsweb graphslegal dominating sequence
Integer programming (90C10) 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
Cites Work
- Unnamed Item
- Unnamed Item
- Total dominating sequences in graphs
- Dominating sequences in graphs
- An order-based algorithm for minimum dominating set with application in graph mining
- Total dominating sequences in trees, split graphs, and under modular decomposition
- A combinatorical proof of Kneser's conjecture
- Realizations of the game domination number
- Facets of the polytope of legal sequences
- Almost all webs are not rank-perfect
- Domination Game and an Imagination Strategy
- Grundy domination and zero forcing in Kneser graphs
- Extremal Problems for Game Domination Number