Independent bondage number of a graph

Bruce Priddy, Haiying Wang () and Bing Wei
Additional contact information
Bruce Priddy: University of Mississippi
Haiying Wang: China University of Geosciences (Beijing)
Bing Wei: University of Mississippi

Journal of Combinatorial Optimization, 2019, vol. 37, issue 2, No 17, 702-712

Abstract: Abstract A vertex set S of a simple finite graph $$G=(V;E)$$ G = ( V ; E ) is said to be an independent set if there is no edge between any pair of vertices of S and a dominating set if for any $$v\in V-S$$ v ∈ V - S , $$uv\in E$$ u v ∈ E for some $$u\in S$$ u ∈ S . If S is both independent and dominating in G, then S is an independent dominating set. Let i(G) denote the cardinality of a minimum independent dominating set of G. Set $$b_i(G)=\min \{|E'|~: E'\subseteq E, i(G)

Keywords: Dominating set; Independent dominating set; Bondage number; Independent Bondage number (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0319-1 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:jcomop:v:37:y:2019:i:2:d:10.1007_s10878-018-0319-1

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

DOI: 10.1007/s10878-018-0319-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().