Search
Abstract
For a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize all trees with equal domination and total outer-independent domination numbers.
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
UTILITAS MATHEMATICA
pages 197 - 206,
ISSN: 0315-3681 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Krzywkowski M.: On trees with equal domination and total outer-independent domination numbers// UTILITAS MATHEMATICA. -, nr. 98 (2015), s.197-206
- Verified by:
- Gdańsk University of Technology
seen 115 times