Search
Abstract
A 2-outer-independent 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, and the set V(G)D is independent. The 2-outer-independent domination number of a graph G, denoted by gamma_2^{oi}(G), is the minimum cardinality of a 2-outer-independent dominating set of G. We prove that for every nontrivial tree T of order n with l leaves we have gamma_2^{oi}(T) <= (n+l)/2, and we characterize the trees attaining this upper bound.
Citations
-
6
CrossRef
-
0
Web of Science
-
5
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:
-
COMPTES RENDUS MATHEMATIQUE
no. 349,
pages 1123 - 1125,
ISSN: 1631-073X - Language:
- English
- Publication year:
- 2011
- Bibliographic description:
- Krzywkowski M.: An upper bound on the 2-outer-independent domination number of a tree// COMPTES RENDUS MATHEMATIQUE. -Vol. 349, nr. Iss. 1 (2011), s.1123-1125
- DOI:
- Digital Object Identifier (open in new tab) 10.1016/j.crma.2011.10.005
- Verified by:
- Gdańsk University of Technology
seen 101 times