On trees with equal 2-domination and 2-outer-independent domination numbers - Publication - Bridge of Knowledge

Search

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

Abstract

For a graph G = (V,E), a subset D \subseteq 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.

Citations

  • 4

    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:
INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS no. 46, pages 191 - 195,
ISSN: 0019-5588
Language:
English
Publication year:
2015
Bibliographic description:
Krzywkowski M.: On trees with equal 2-domination and 2-outer-independent domination numbers// INDIAN JOURNAL OF PURE & APPLIED MATHEMATICS. -Vol. 46, nr. 2 (2015), s.191-195
DOI:
Digital Object Identifier (open in new tab) 10.1007/s13226-015-0126-7
Verified by:
Gdańsk University of Technology

seen 56 times

Recommended for you

Meta Tags