Abstract.
In this article we present characterizations of locally well-dominated graphs and locally independent well-dominated graphs, and a sufficient condition for a graph to be k-locally independent well-dominated. Using these results we show that the irredundance number, the domination number and the independent domination number can be computed in polynomial time within several classes of graphs, e.g., the class of locally well-dominated graphs.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 13, 2001 Final version received: May 17, 2002
RID="*"
ID="*" Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093)
RID="†"
ID="†" Supported by RUTCOR
RID="*"
ID="*" Supported by the INTAS and the Belarus Government (Project INTAS-BELARUS 97-0093)
05C75, 05C69
Acknowledgments. The authors thank the referees for valuable suggestions.
Rights and permissions
About this article
Cite this article
Zverovich, I., Zverovich, V. Locally Well-Dominated and Locally Independent Well-Dominated Graphs. Graphs and Combinatorics 19, 279–288 (2003). https://doi.org/10.1007/s00373-002-0507-7
Issue Date:
DOI: https://doi.org/10.1007/s00373-002-0507-7