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ı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Abstract. Computer scientists and network scientists want a speedy, reliable, and nonstop communication. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stationsor communication links. The average lower 2-domination number of a graph G relative to a vertex v is the cardinality of a minimum 2-dominating set in G containingv. Consider the graph G modeling a network. The average lower 2-domination number of G, denoted as ?2av(G), is a new measure of the network vulnerability, given by?2av(G) = 1|V (G)|Pv?V (G)?2v(G). In this paper, above mentioned new parameter isdefined and examined, also the average lower 2-domination number of well known graphfamilies are calculated. Then upper and lower bounds are determined and exact formulasare found for the average lower 2-domination number of any graph G.
Açıklama
Anahtar Kelimeler
Kaynak
TWMS (Turkic World Mathematical Society) Journal of Applied and Engineering Mathematics
WoS Q Değeri
Scopus Q Değeri
Cilt
9
Sayı
3
