On exponential domination and graph operations
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Semnan Univ
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
An exponential dominating set of graph G = (V, E) is a subset S subset of V (G) such that Sigma(u is an element of S)(1/2)(<(dover bar>(u,v)-1) >= 1 for every vertex v in V (G) - S, where (d) over bar (u,v) is the distance between vertices u is an element of S and v is an element of V(G) - S in the graph G - (S - {u}). The exponential domination number, gamma(e)(G), is the smallest cardinality of an exponential dominating set. Graph operations are important methods for constructing new graphs, and they play key roles in the design and analysis of networks. In this study, we consider the exponential domination number of graph operations including edge corona, neighborhood corona and power.
Açıklama
Anahtar Kelimeler
Graph vulnerability, network design and communication, exponential domination number, edge corona, neighbourhood corona
Kaynak
International Journal of Nonlinear Analysis and Applications
WoS Q Değeri
N/A
Scopus Q Değeri
Cilt
8
Sayı
2
