Computation of Grundy dominating sequences in (co-)bipartite graphs
From MaRDI portal
Publication:6184795
DOI10.1007/s40314-023-02500-warXiv2310.10566OpenAlexW4388895444MaRDI QIDQ6184795
Arti Pandey, Boštjan Brešar, Gopika Sharma
Publication date: 5 January 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2310.10566
Hypergraphs (05C65) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Total dominating sequences in graphs
- Dominating sequences in graphs
- Grundy dominating sequences on \(X\)-join product
- Grundy domination of forests and the strong product conjecture
- 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
- Uniform length dominating sequence graphs
- Domination Game and an Imagination Strategy
- Domination in Graphs: Core Concepts
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Domination Games Played on Graphs
- Vertex sequences in graphs
This page was built for publication: Computation of Grundy dominating sequences in (co-)bipartite graphs