On trees with equal 2-domination and 2-outer-independent domination numbers

Marcin Krzywkowski ()
Additional contact information
Marcin Krzywkowski: University of Johannesburg

Indian Journal of Pure and Applied Mathematics, 2015, vol. 46, issue 2, 191-195

Abstract: Abstract For a graph G = (V, E), a subset D ⊆ V(G) is a 2-dominating set if every vertex of V(G)\D has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees with equal 2-domination and 2-outer-independent domination numbers.

Keywords: 2-domination; 2-outer-independent domination; tree (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s13226-015-0126-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:46:y:2015:i:2:d:10.1007_s13226-015-0126-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-015-0126-7

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().