- Tytuł:
- Concepts Arising from Strong Efficient Domination Number. Part II
- Autorzy:
-
Meena, N.
Priyanka, G. Jeba - Powiązania:
- https://bibliotekanauki.pl/articles/1031591.pdf
- Data publikacji:
- 2020
- Wydawca:
- Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
- Tematy:
-
Domination
strong efficient domination
strong efficient non bondage number - Opis:
- 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∈V(G),|N_s [v]∩S|=1.( |N_w [v]∩S|=1), where〖 N〗_s (v)={u∈V(G):uv∈E(G),degu≥degv}(N_w (v){u∈V(G),uv∈E(G),degv≥degu}. 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 γ_se (G)(γ_we (G)). The strong efficient non bondage number b_sen (G) is the maximum cardinality of all sets of edge X⊆E such that γ_se (G-X) = γ_se (G). In this paper, the strong efficient non bondage number of some corona related graphs are studied.
- Źródło:
-
World Scientific News; 2020, 146; 22-35
2392-2192 - Pojawia się w:
- World Scientific News
- Dostawca treści:
- Biblioteka Nauki
Artykuł