Computing the average distance of an interval graph
References (17)
Average distance in undirected graphs and the removal of vertices
J. Combin. Theory Ser. B
(1990)- et al.
Mean distance in a graph
Discrete Math.
(1977) - et al.
A unified approach to domination problems in interval graphs
Inform. Process. Lett.
(1988) Mean distance in a tree
Discrete Appl. Math.
(1990)- et al.
Average distance in graphs with removed elements
J. Graph Theory
(1988) The average distance and the independence number
J. Graph Theory
(1988)Average distance and independence number
Discrete Appl. Math.
(1994)- et al.
On the mean distance between points of a graph
Congr. Numer.
(1988)
There are more references available in the full text version of this article.
Cited by (20)
On Wiener index and average eccentricity of graphs of girth at least 6 and (C<inf>4</inf>,C<inf>5</inf>)-free graphs
2023, Discrete Applied MathematicsOn average distance in tournaments and Eulerian digraphs
2019, Discrete Applied MathematicsCitation Excerpt :In this section, we present two upper bounds on the average distance of tournaments; the first bound is in terms of its order and edge-connectivity, and the second bound is in terms of its diameter only. In the proofs, we make use of the weighted Wiener index of undirected graphs, first defined in [2] under the name weighted distance, and two upper bounds. [7]
Average distance in weighted graphs
2012, Discrete MathematicsA linear-time algorithm to compute a MAD tree of an interval graph
2004, Information Processing LettersMAD trees and distance-hereditary graphs
2003, Discrete Applied MathematicsAverage distance and domination number
1997, Discrete Applied Mathematics
Copyright © 1993 Published by Elsevier B.V.