Exponential Domination Critical and Stability in Some Graphs
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
World Scientific Publ Co Pte Ltd
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
An exponential dominating set of graph G = (V, E) is a kind of distance domination subset S subset of V(G) such that Sigma(u is an element of S)(1/2)((d) over bar (u,v)-1) >= 1, for all v E V(G), where (d) over bar (u, v) is the length of a shortest path in < V(G)- (S - {u})> if such a path exists, and Do otherwise. The minimum exponential domination number, gamma(e) (G) is the smallest cardinality of an exponential dominating set. The minimum exponential domination number, gamma(e) (G) can be decreased or increased by removal of some vertices from G. In this paper, we investigate of this phenomenon which is referred to critical and stability in graphs.
Açıklama
Anahtar Kelimeler
Graph vulnerability, network design and communication, domination, exponential domination number
Kaynak
International Journal of Foundations of Computer Science
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
30
Sayı
5
