Strong weak domination in complementary prisms
Küçük Resim Yok
Tarih
2015
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Watam Press
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Let G = (V(G),E(G)) be a graph. If uv ? E(G), then u and v dominate each other. Further, u strongly dominates v and v weakly dominates u if deg(u) ? deg(v). A set S ? V(G) is a strong-dominating set (sd-set) of G if every vertex in V(G) - S is strongly dominated by at least one vertex in S. Similarly, if every vertex in V(G) - S is weakly dominated by at least one vertex in S, then S is a weak-dominating set (wd-set). The strong (weak) domination number ?s(?w) of G is the minimum cardinality of an sdset (wd-set). In this paper the strong and weak domination numbers of complementary prisms are determined and also an algorithm for computing for strong and weak domination number of any graph is given. Copyright © 2015 Watam Press.
Açıklama
Anahtar Kelimeler
Complementary prisms, Connectivity, Graph algorithms, Graph vulnerability, Network design and communication, Strong and weak domination number
Kaynak
Dynamics of Continuous, Discrete and Impulsive Systems Series B: Applications and Algorithms
WoS Q Değeri
Scopus Q Değeri
Q4
Cilt
22
Sayı
2
