Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index andWiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth,sixth and seventh largest Wiener indices among all unicyclic graphs of order$n\geqslant 10$ are characterized; as well the graphs with the first, second,third, and fourth largest Wiener indices among all bicyclic graphs areidentified. Based on these results, further relation on the quotients betweenthe (revised) Szeged index and the Wiener index are studied. Sharp lower boundon $Sz(G)/W(G)$ is determined for all connected graphs each of which containsat least one non-complete block. As well the connected graph with the secondsmallest value on $Sz^*(G)/W(G)$ is identified for $G$ containing...
Research Division, Laxmi Pest and Fumigation Pvt. Ltd., 3 Khatipura, Indore-452 007, India School o...
AbstractLet G be a connected graph and η(G)=Sz(G)−W(G), where W(G) and Sz(G) are the Wiener and Szeg...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
Let W (G) and Sz(G) be the Wiener index and the Szeged index of a connected graph G. It is proved th...
We resolve two conjectures of Hri\v{n}\'{a}kov\'{a}, Knor and \v{S}krekovski (2019) concerning the r...
Let Sz?(G) and W (G) be the revised Szeged index and the Wiener index of a graph G. Chen, Li, and Li...
Improved bounds on the difference between the Szeged index and the Wiener index of graphs Sandi Klav...
AbstractLet G be a connected graph and η(G)=Sz(G)−W(G), where W(G) and Sz(G) are the Wiener and Szeg...
We resolve two conjectures of Hriňáková et al. (2019)[10] concerning the relationship between the va...
In this paper, we prove a collection of results on graphical indices. Wedetermine the extremal graph...
Let G be a graph. The Wiener index of G is defined as W(G) = 1/2∑{x,y}⊆V(G)d(x,y), where V(G) is th...
AbstractWe have revisited the Szeged index (Sz) and the revised Szeged index (Sz∗), both of which re...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu(e)nv(e) over all edg...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Research Division, Laxmi Pest and Fumigation Pvt. Ltd., 3 Khatipura, Indore-452 007, India School o...
AbstractLet G be a connected graph and η(G)=Sz(G)−W(G), where W(G) and Sz(G) are the Wiener and Szeg...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...
Let W (G) and Sz(G) be the Wiener index and the Szeged index of a connected graph G. It is proved th...
We resolve two conjectures of Hri\v{n}\'{a}kov\'{a}, Knor and \v{S}krekovski (2019) concerning the r...
Let Sz?(G) and W (G) be the revised Szeged index and the Wiener index of a graph G. Chen, Li, and Li...
Improved bounds on the difference between the Szeged index and the Wiener index of graphs Sandi Klav...
AbstractLet G be a connected graph and η(G)=Sz(G)−W(G), where W(G) and Sz(G) are the Wiener and Szeg...
We resolve two conjectures of Hriňáková et al. (2019)[10] concerning the relationship between the va...
In this paper, we prove a collection of results on graphical indices. Wedetermine the extremal graph...
Let G be a graph. The Wiener index of G is defined as W(G) = 1/2∑{x,y}⊆V(G)d(x,y), where V(G) is th...
AbstractWe have revisited the Szeged index (Sz) and the revised Szeged index (Sz∗), both of which re...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
The Szeged index Sz(G) of a simple connected graph G is the sum of the terms nu(e)nv(e) over all edg...
summary:The Wiener index of a connected graph is defined as the sum of the distances between all uno...
Research Division, Laxmi Pest and Fumigation Pvt. Ltd., 3 Khatipura, Indore-452 007, India School o...
AbstractLet G be a connected graph and η(G)=Sz(G)−W(G), where W(G) and Sz(G) are the Wiener and Szeg...
The Szeged index is a new topological index based on distances between the vertices of a graph. The ...