THE AVERAGE LOWER REINFORCEMENT NUMBER OF A GRAPH
Küçük Resim Yok
Tarih
2016
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Edp Sciences S A
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Let G = (V (G), E(G)) be a simple undirected graph. The reinforcement number of a graph is a vulnerability parameter of a graph. We have investigated a refinement that involves the average lower reinforcement number of this parameter. The lower reinforcement number, denoted by r(e*) (G), is the minimum cardinality of reinforcement set in G that contains the edge e* of the complement graph G. The average lower reinforcement number of G is defined by r(av)(G) = 1/ |E(G)| Sigma(e*)is an element of E((G) over bar) r(e*) (G). In this paper, we define the average lower reinforcement number of a graph and we present the exact values for some well-known graph families.
Açıklama
Anahtar Kelimeler
Graph vulnerability, connectivity, network design and communication, domination number, reinforcement number, average lower reinforcement number
Kaynak
Rairo-Theoretical Informatics and Applications
WoS Q Değeri
Q4
Scopus Q Değeri
Q2
Cilt
50
Sayı
2
