Balcı, Mehmet AliDündar, Pınar2018-05-022018-05-022010Balcı, M. A., Dündar, P. (2010). Average edge-distance in graphs. Selcuk Journal of Applied Mathematics, 11 (2), 63-70.1302-7980https://hdl.handle.net/20.500.12395/10513URL: http://sjam.selcuk.edu.tr/sjam/article/view/267The 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.eninfo:eu-repo/semantics/openAccessGraph theoryEdge-distanceAverage edge-distanceKenar mesafeliOrtalama kenar mesafesiGrafik teorisiArticle116370