average distance in a graph

If a graph G has an average distance d, that is, the mean of
the shortest path distance between any two vertices, if a vertices
and b edges are deleted from G randomly, by how much the
average distance would increase? Is there any upper/lower
bound on this? Would it be sensitive to which edges are deleted
if the edges are not randomly picked?

Thanks.


.

Relevant Pages

  • Re: average distance in a graph
    ... Is there any result for general graph or a special family of graphs ... that deleting edges won't increase the average distance much ... > only other connection between them being a line of 100 vertices: ... > Deleting the direct connecting edge vastly increases the average ...
    (sci.math)
  • Re: average distance in a graph
    ... > average distance would increase? ... E.g. what is the average distance for this graph: ... only other connection between them being a line of 100 vertices: ... Deleting any other edge does not. ...
    (sci.math)
  • Re: average distance in a graph
    ... >the shortest path distance between any two vertices, ... >average distance would increase? ... If the graph is still connected, there will never be a distance longer than ... A minimally-connected star graph has the same number of nodes and edges as a ...
    (sci.math)
  • average distance in a graph
    ... If a graph G has an average distance d, that is, the mean of ... the shortest path distance between any two vertices, ... average distance would increase? ... Prev by Date: ...
    (sci.math.research)
  • average distance in a graph
    ... If a graph G has an average distance d, that is, the mean of ... the shortest path distance between any two vertices, ... average distance would increase? ... Prev by Date: ...
    (sci.math)