Computational aspects of double dominating sequences in graphs

DOI10.1007/978-3-031-25211-2_22MaRDI QIDQ6132543zbMATH OpenOpenAlexFDO

Authors Gopika Sharma, Arti Pandey

Publication date 17 August 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-25211-2_22

zbMATH Keywords

NP-completenessbipartite graphschain graphsdouble dominating sequences

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3914370 (Why is no real title available?)
• scientific article; zbMATH DE number 3914371 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1095172 (Why is no real title available?)
• scientific article; zbMATH DE number 7583648 (Why is no real title available?)
• Dominating sequences in graphs
• Domination game and an imagination strategy
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Structures of domination in graphs
• Topics in Domination in Graphs
• Vertex sequences in graphs

Cited in

(2)

• scientific article; zbMATH DE number 7583648 (Why is no real title available?)
• Doubling Algorithms with Permuted Lagrangian Graph Bases

This page was built for publication: Computational aspects of double dominating sequences in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132543)