Average edge-distance in graphs

Basit Öğe Kaydı
dc.contributor.authorBalcı, Mehmet Ali
dc.contributor.authorDündar, Pınar
dc.date.accessioned2018-05-02T07:11:36Z
dc.date.available2018-05-02T07:11:36Z
dc.date.issued2010
dc.descriptionURL: http://sjam.selcuk.edu.tr/sjam/article/view/267en_US
dc.description.abstractThe 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.en_US
dc.identifier.citationBalcı, M. A., Dündar, P. (2010). Average edge-distance in graphs. Selcuk Journal of Applied Mathematics, 11 (2), 63-70.en_US
dc.identifier.endpage70
dc.identifier.issn1302-7980en_US
dc.identifier.startpage63
dc.identifier.urihttps://hdl.handle.net/20.500.12395/10513
dc.identifier.volume11
dc.language.isoenen_US
dc.publisherSelcuk University Research Center of Applied Mathematicsen_US
dc.relation.ispartofSelcuk Journal of Applied Mathematicsen_US
dc.relation.publicationcategoryMakale - Kategori Belirleneceken_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectGraph theoryen_US
dc.subjectEdge-distanceen_US
dc.subjectAverage edge-distanceen_US
dc.subjectKenar mesafelien_US
dc.subjectOrtalama kenar mesafesien_US
dc.subjectGrafik teorisien_US
dc.titleAverage edge-distance in graphsen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
Mehmet Ali Balcı, Pınar Dündar.pdf
Boyut:
134.77 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.51 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Selcuk Journal of Applied Mathematics/ makale koleksiyonu