Algorithmic Aspects of Some Variants of Domination in Graphs

DOI10.2478/auom-2020-0039zbMath1488.05391arXiv2002.00002OpenAlexW3118753906MaRDI QIDQ5002958

J. Pavan Kumar, P. Venkata Subba Reddy

Publication date: 28 July 2021

Published in: Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.00002

zbMATH Keywords

NP-completenessindependent setdominationcomplexity classesAPX-hardnesssecure domination

Mathematics Subject Classification ID

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)

Related Items (1)

Algorithmic aspects of 2-secure domination in graphs

This page was built for publication: Algorithmic Aspects of Some Variants of Domination in Graphs