Search
Abstract
A vertex of a graph is said to dominate itself and all of its neighbors. A subset D subseteq V(G) is a 2-dominating set of G if every vertex of V(G)D is dominated by at least two vertices of D, while it is a double dominating set of G if every vertex of G is dominated by at least two vertices of D. The 2-domination (double domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (double dominating, respectively) set of G. We characterize all trees with the double domination number equal to the 2-domination number plus one.
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:
-
HOUSTON JOURNAL OF MATHEMATICS
no. 39,
pages 427 - 440,
ISSN: 0362-1588 - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Krzywkowski M.: On trees with double domination number equal to 2-domination number plus one// HOUSTON JOURNAL OF MATHEMATICS. -Vol. 39, nr. 2 (2013), s.427-440
- Verified by:
- Gdańsk University of Technology
seen 127 times