On the average lower 2-domination number of a graph
Küçük Resim Yok
Tarih
2019
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Isik University
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Computer scientists and network scientists want a speedy, reliable, and non- stop communication. In a communication network, the vulnerability measures the re- sistance of the network to disruption of operation after the failure of certain stations or communication links. The average lower 2-domination number of a graph G rela- tive to a vertex v is the cardinality of a minimum 2-dominating set in G containing v. Consider the graph G modeling a network. The average lower 2-domination num- ber of G, denoted as ?2av(G), is a new measure of the network vulnerability, given by ?2av(G) = 1/|V(G)|?v?V(G) ?2v(G). In this paper, above mentioned new parameter is defined and examined, also the average lower 2-domination number of well known graph families are calculated. Then upper and lower bounds are determined and exact formulas are found for the average lower 2-domination number of any graph G. © Işik University, Department of Mathematics, 2019.
Açıklama
Anahtar Kelimeler
Average lower 2-domination number, Connectivity, Dom- ination number, Graph vulnerability, Network design and communication
Kaynak
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
WoS Q Değeri
Scopus Q Değeri
Q4
Cilt
9
Sayı
3
