Search
Abstract
A 2-dominating set of a graph G=(V,E) is a set D of vertices of G such that every vertex of V(G)D has at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. The non-isolating 2-bondage number of G, denoted by b_2'(G), is the minimum cardinality among all sets of edges E' subseteq E such that delta(G-E') >= 1 and gamma_2(G-E') > gamma_2(G). If for every E' subseteq E, either gamma_2(G-E') = gamma_2(G) or delta(G-E') = 0, then we define b_2'(G) = 0, and we say that G is a gamma_2-non-isolatingly strongly stable graph. First we discuss the basic properties of non-isolating 2-bondage in graphs. We find the non-isolating 2-bondage numbers for several classes of graphs. Next we show that for every non-negative integer there exists a tree having such non-isolating 2-bondage number. Finally, we characterize all gamma_2-non-isolatingly strongly stable trees.
Citations
-
3
CrossRef
-
0
Web of Science
-
3
Scopus
Cite as
Full text
- Publication version
- Accepted or Published Version
- DOI:
- Digital Object Identifier (open in new tab) 10.2969/jmsj/06510037
- License
- Copyright (2013 Mathematical Society of Japan)
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN
no. 65,
pages 37 - 50,
ISSN: 0025-5645 - Language:
- English
- Publication year:
- 2013
- Bibliographic description:
- Krzywkowski M.: Non-isolating 2-bondage in graphs// JOURNAL OF THE MATHEMATICAL SOCIETY OF JAPAN. -Vol. 65, nr. 1 (2013), s.37-50
- DOI:
- Digital Object Identifier (open in new tab) 10.2969/jmsj/06510037
- Verified by:
- Gdańsk University of Technology
seen 100 times