Average edge-distance in graphs
Yükleniyor...
Tarih
2010
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Selcuk University Research Center of Applied Mathematics
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The average edge-distance of a connected graph G is the average of the distance between all pairs of edges of G. In this work we give the average edge-distance of a graph, a new vulnerability measure. We also find sub and upper bounds for average edge-distance and give a polynomial time algorithm which calculates the average edge-distance of a graph.
Açıklama
URL: http://sjam.selcuk.edu.tr/sjam/article/view/267
Anahtar Kelimeler
Graph theory, Edge-distance, Average edge-distance, Kenar mesafeli, Ortalama kenar mesafesi, Grafik teorisi
Kaynak
Selcuk Journal of Applied Mathematics
WoS Q Değeri
Scopus Q Değeri
Cilt
11
Sayı
Künye
Balcı, M. A., Dündar, P. (2010). Average edge-distance in graphs. Selcuk Journal of Applied Mathematics, 11 (2), 63-70.
