Computational aspects of double dominating sequences in graphs

DOI10.1007/978-3-031-25211-2_22OpenAlexW4318022959MaRDI QIDQ6132543FDOQ6132543

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Domination game and an imagination strategy
• Title not available (Why is that?)
• Dominating sequences in graphs
• Title not available (Why is that?)
• Linear-time certifying recognition algorithms and forbidden induced subgraphs
• Topics in Domination in Graphs
• Structures of domination in graphs
• Vertex sequences in graphs
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• 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)