Secure domination is NP-complete on bisplit graphs with a P/NP-C dichotomy under chordality, polynomial-time solvable on chain graphs, and inapproximable within (1-ε)ln|V|.
Correcting the algorithm for the secure domination number of cographs by jha, pradhan, and banerjee
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Secure Domination in Bisplit graphs -- A Structural and algorithmic study
Secure domination is NP-complete on bisplit graphs with a P/NP-C dichotomy under chordality, polynomial-time solvable on chain graphs, and inapproximable within (1-ε)ln|V|.