ABSTRACT
Let G = (V,E) be a simple graph. A subset S of V(G) is called a strong (weak) efficient dominating set of G if for every vβπ(πΊ),|ππ[π]β©π|=1.( |ππ€[π£]β©π|=1), where ππ (π£)={π’βπ(πΊ):π’π£βπΈ(πΊ),ππππ’β₯ππππ£}(ππ€(π£){π’βπ(πΊ),π’π£βπΈ(πΊ),ππππ£β₯ππππ’}. The minimum cardinality of a strong (weak) efficient dominating set of G is called the strong (weak) efficient domination number of G and denoted by πΎπ π(πΊ)(πΎπ€π(πΊ)). The strong efficient non bondage number ππ ππ(πΊ) is the maximum cardinality of all sets of edge πβπΈ such that πΎπ π(πΊβπ) = πΎπ π(πΊ). In this paper, the strong efficient non bondage number of some corona related graphs are studied.
Support the magazine and subscribe to the content
This is premium stuff. Subscribe to read the entire article.
