On the bondage, strong and weak bondage numbers in Complementary Prism Graphs
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Inst Mathematics & Computer Science Acad
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Let G = (V (G), E(G)) be a simple undirected graph of order n, and let S subset of (G). If every vertex in V (G) - S is adjacent to at least one vertex in S, then the set S is called a dominating set. The domination number of G is the minimum cardinality taken over all sets of S, and it is denoted by gamma(G). Recently, the effect of one or more edges deletion on the domination number has been examined in many papers. Let F subset of E(G). The bondage number b(G) of G is the minimum cardinality taken over all sets of F such that gamma(G - F) > gamma(G). In the literature, a lot of domination and bondage parameters have been defined depending on different properties. In this paper, we investigate the bondage, strong and weak bondage numbers of complementary prism graphs of some well-known graph families.
Açıklama
Anahtar Kelimeler
Connectivity, Domination number, Strong and weak domination numbers, Bondage number, Strong and weak bondage numbers, Complementary prism graphs
Kaynak
Computer Science Journal Of Moldova
WoS Q Değeri
N/A
Scopus Q Değeri
N/A
Cilt
29
Sayı
1
