ON THE DOMINATION, STRONG AND WEAK DOMINATION IN TRANSFORMATION GRAPH Gxy-
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Util Math Publ Inc
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Let G = (V(G), E(G)) be a simple undirected graph of order vs and size m, and x, y, z be three variables taking value + or -. The transformation graph of G, G(xyz) is a simple graph having V(G) boolean OR E(G) as the vertex set. If an expression has n variables, and each variable can have the value + or -, the number of different combinations of values of the variables is 2(n). Thus, we obtain eight kinds of transformation graphs. A set S subset of V(G) is a dominating set if every vertex in V(G) - S is adjacent to at least one vertex in S. The minimum cardinality taken over all dominating sets of G is called the domination number of G and is denoted by gamma(G). There are several types of domination parameters depending upon the nature of dominating sets. In this paper, we investigate the domination number, the strong domination number and the weak domination number of the transformation graph G(xy)(-).
Açıklama
Anahtar Kelimeler
Graph vulnerability, Connectivity, Network design and communication, Domination number, Strong and weak domination number, Transformation graphs
Kaynak
Utilitas Mathematica
WoS Q Değeri
Q4
Scopus Q Değeri
Cilt
113
