The failed power domination number is NP-hard to compute, and exact values are given for complete bipartite graphs, ladders, and layered complete graphs.
Failed skew zero forcing on a graph
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Failed power domination on graphs
The failed power domination number is NP-hard to compute, and exact values are given for complete bipartite graphs, ladders, and layered complete graphs.