Computation of Grundy dominating sequences in (co-)bipartite graphs

DOI10.1007/S40314-023-02500-WMaRDI QIDQ6184795zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

bipartite graphchain graphscomputational complexitydominating sequencelinear-time algorithm

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 7583648
• Dominating sequences in graphs
• Total dominating sequences in trees, split graphs, and under modular decomposition
• Grundy coloring in some subclasses of bipartite graphs and their complements

Cites work

• An integer programming approach for solving a generalized version of the Grundy domination number
• Dominating sequences in graphs
• Dominating sequences under atomic changes with applications in Sierpiński and interval graphs
• Domination game and an imagination strategy
• Domination games played on graphs
• Domination in Graphs: Core Concepts
• Grundy dominating sequences and zero forcing sets
• Grundy dominating sequences on X-join product
• Grundy domination of forests and the strong product conjecture
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Structures of domination in graphs
• Topics in Domination in Graphs
• Total dominating sequences in graphs
• Uniform length dominating sequence graphs
• Vertex sequences in graphs
• Zero forcing number, Grundy domination number, and their variants

Cited in

(2)

• scientific article; zbMATH DE number 7583648 (Why is no real title available?)
• Grundy double domination number: bounds, graph operations, and efficient computation for P₄-tidy graphs

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)