Search
Abstract
A 2-dominating set of a graph G is a set D of vertices of G such that every vertex of V(G)D has a at least two neighbors in D. A total outer-independent dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V(G)D is independent. The 2-domination (total outer-independent domination, respectively) number of a graph G is the minimum cardinality of a 2-dominating (total outer-independent dominating, respectively) set of G. We investigate the ratio between 2-domination and total outer-independent domination numbers of trees.
Citations
-
1
CrossRef
-
0
Web of Science
-
2
Scopus
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:
-
CHINESE ANNALS OF MATHEMATICS SERIES B
no. 34,
edition 5,
pages 765 - 776,
ISSN: 0252-9599 - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Krzywkowski M.: On the ratio between 2-domination and total outer-independent domination numbers of trees// CHINESE ANNALS OF MATHEMATICS SERIES B. -Vol. 34, iss. 5 (2013), s.765-776
- DOI:
- Digital Object Identifier (open in new tab) 10.1007/s11401-013-0788-6
- Verified by:
- Gdańsk University of Technology
seen 112 times