On vulnerability of the hexagonal cactus chains
Küçük Resim Yok
Tarih
2018
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Let G = (V(G), E(G) be a simple molecular graph without directed and multiple edges and without loops. The vulnerability value of agraph shows the resistance of the network after the disruption of some centers or connection lines until a communication breakdown.The domination number and its variations are the most important vulnerability parameters for graphs. One of them is the averagelower domination number. It is denoted by ?av(G), also is defined as: GV G1cav ^ =^hh ?v?V(G) ?v(G), where the lower dominationnumber, denoted by ?v(G), is the minimum cardinality of a dominating set of the graph G that contains the vertex v (Henning 2004).In this paper, the average lower domination number of different hexagonal cactus chains are determined.
Açıklama
Anahtar Kelimeler
Kaynak
Karaelmas Fen ve Mühendislik Dergisi
WoS Q Değeri
Scopus Q Değeri
Cilt
8
Sayı
1
