Computation of Grundy dominating sequences in (co-)bipartite graphs
DOI10.1007/S40314-023-02500-WarXiv2310.10566OpenAlexW4388895444MaRDI QIDQ6184795FDOQ6184795
Authors: Boštjan Brešar, Arti Pandey, 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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Hypergraphs (05C65)
Cites Work
- Total dominating sequences in graphs
- Domination game and an imagination strategy
- Dominating sequences in graphs
- Linear-time certifying recognition algorithms and forbidden induced subgraphs
- Domination games played on graphs
- Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
- Zero forcing number, Grundy domination number, and their variants
- Grundy dominating sequences and zero forcing sets
- Grundy dominating sequences on \(X\)-join product
- Domination in Graphs: Core Concepts
- Topics in Domination in Graphs
- Grundy domination of forests and the strong product conjecture
- Structures of domination in graphs
- An integer programming approach for solving a generalized version of the Grundy domination number
- Uniform length dominating sequence graphs
- Vertex sequences in graphs
Cited In (1)
This page was built for publication: Computation of Grundy dominating sequences in (co-)bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6184795)
