The cut method is a powerful tool for the investigation of distance-based (and some other)
molecular structure-descriptors. In this paper a survey on the recent developments of the …

Average distance is an important parameter for measuring the communication cost of
computer networks. A popular approach for its computation is to first partition the edge set of …

Sharp upper bounds on the average eccentricity of a connected graph of given order in
terms of its independence number, chromatic number, domination number or connected …

Abstract Let W (G) and S z (G) be the Wiener index and the Szeged index of a connected
graph G, respectively. It is proved that if G is a connected bipartite graph of order n≥ 4, size …

+ 2n (n− 1) on the Wiener index W (G) of a graph G of order n, minimum degree δ and
maximum degree∆. We prove a similar result for triangle-free graphs, and we determine a …

Exchanged hypercubes (Loh et al. in IEEE Trans Parallel Distrib Syst 16: 866–874, 2005)
are spanning subgraphs of hypercubes with about one half of their edges but still with many …

There has been a great deal of interest in the computation of distances and shortest paths
problem in graphs which is one of the central, and most studied, problems in (algorithmic) …

Abstract Let G=(V, E) be a connected graph of order n. The distance, d G (x, y), between
vertices x and y in G is defined as the length of a shortest xy path in G. The average …

The eccentricity of a vertex $ u $ in a connected graph $ G $ is the distance between $ u $
and a vertex farthest from it; the eccentric sequence of $ G $ is the nondecreasing sequence …

Let G be a finite, connected graph. The eccentricity of a vertex v of G is the distance from v to
a vertex farthest from v. The average eccentricity avec (G) of G is the arithmetic mean of the …