2-outer-independent domination in graphs - Publication - Bridge of Knowledge

Search

2-outer-independent domination in graphs

Abstract

We initiate the study of 2-outer-independent domination in graphs. 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 at least two neighbors in D, and the set V(G)\D is independent. The 2-outer-independent domination number of a graph G is the minimum cardinality of a 2-outer-independent dominating set of G. We show that if a graph has minimum degree at least two, then its 2-outer-independent domination number equals the vertex cover number. Then we investigate the 2-outer-independent domination in graphs with minimum degree one.

Citations

  • 7

    CrossRef

  • 0

    Web of Science

  • 9

    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:
NATIONAL ACADEMY SCIENCE LETTERS-INDIA no. 38, edition 3, pages 263 - 269,
ISSN: 0250-541X
Language:
English
Publication year:
2015
Bibliographic description:
Jafari Rad N., Krzywkowski M.: 2-outer-independent domination in graphs// NATIONAL ACADEMY SCIENCE LETTERS-INDIA. -Vol. 38, iss. 3 (2015), s.263-269
DOI:
Digital Object Identifier (open in new tab) 10.1007/s40009-015-0389-x
Verified by:
Gdańsk University of Technology

seen 127 times

Recommended for you

Meta Tags