Answers are grounded in this paper and cite their sources.
In a graph [Formula: see text], a dominating set [Formula: see text] is a bi-efficient dominating set of [Formula: see text], if for every vertex [Formula: see text] in [Formula: see text], [Formula: see text]. The bi-efficient domination number of [Formula: see text], denoted by [Formula: see text] is the minimum cardinality of a bi-efficient dominating set of [Formula: see text], if it exists. In this paper, many bounds of [Formula: see text] are obtained and its relationship with other parameters are investigated. The complexity of the problem is studied for bipartite and chordal graphs. An algorithm has been designed to find bi-efficient domination number of trees and unicyclic graphs. Further, the problem is shown to be fixed-parameter tractable when parameterized by treewidth of the input graph.
No takes yet. Share an insight, caveat, or question.
Vidya et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: