The Wiener index W(G) of a connected graph G is defined as the sum of the distances between all unordered pairs of vertices of G. The eccentricity of a vertex v in G is the distance to a vertex farthest from v. In this paper we obtain the Wiener index of a graph in terms of eccentricities. Further we extend these results to the self-centered graphs.

the $k$-th semi total point graph $r^k(g)$ of a graph $g$, is a graph obtained from $g$ by adding $k$ vertices corresponding to each edge and connecting them to endpoint of edge considered. in this paper, we obtain formulae for the resistance distance and kirchhoff index of $r^k(g)$.

The degree distance of a graph G is     , 1 1 1 2 n n i j i i j D G d d L        j , where and i d j d are the degrees of vertices , and is the distance between them. The Wiener index is defined as   , i j v v V G  , i j L   , 1 1 1 2 n n i j i j W G L      . An elegant result (Gutman; Klein, Mihalić,, Plavšić and Trinajstić) is known regarding their correlation, that   ...

‎A set of vertices $S$ of a graph $G$ is called a fixing set of $G$‎, ‎if only the trivial automorphism of $G$ fixes every vertex in $S$‎. ‎The fixing number of a graph is the smallest cardinality of a fixing‎ ‎set‎. ‎The fixed number of a graph $G$ is the minimum $k$‎, ‎such that ‎every $k$-set of vertices of $G$ is a fixing set of $G$‎. ‎A graph $G$‎ ‎is called a $k$-fixed graph‎, ‎if its fix...

‎    The Narumi-Katayama index is the first topological index defined by the product of some graph theoretical quantities. Let G be a simple graph. Narumi-Katayama index of G is defined as the product of the degrees of the vertices of G. In this paper, we define the Narumi-Katayama polynomial of G. Next, we investigate some properties of this polynomial for graphs and then, we obtain ...

We have studied dependence of distances on nodes degrees between vertices of ErdősRényi random graphs, scale-free Barabási-Albert models, science collaboration networks, biological networks, Internet Autonomous Systems and public transport networks. We have observed that the mean distance between two nodes of degrees ki and k j equals to 〈li j〉 = A−B log(kik j). A simple heuristic theory for th...

cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 g...

We study first passage percolation on the configuration model. Assuming that each edge has anindependent exponentially distributed edge weight, we derive explicit distributional asymptotics forthe minimum weight between two randomly chosen connected vertices in the network, as well as forthe number of edges on the least weight path, the so-called hopcount.We analyze the conf...