Independent bondage number of a graph
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0319-1
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… read more here.
Keywords: bondage number; dominating set; independent bondage; independent dominating ... See more keywords