a lot of research and various techniques have been devoted for finding the topologicaldescriptor wiener index, but most of them deal with only particular cases. there exist threeregular plane tessellations, composed of the same kind of regular polygons namely triangular,square, and hexagonal. using edge congestion-sum problem, we devise a method to computethe wiener index and demonstrate this m...

-The Szeged index Sz is a recently introduced graph invariant, having applications in chemistry. In this paper, a formula for the Szeged index of Cartesian product graphs is obtained and some other composite graphs are considered. We also prove that for all connected graphs, Sz is greater than or equal to the sum of distances between all vertices. A conjecture concerning the maximum value of Sz...

In this paper PI, Szeged and revised Szeged indices of an infinite family of IPR fullerenes with exactly 60+12n carbon atoms are computed. A GAP program is also presented that is useful for our calculations.

Let $G$ be a non-abelian group and let $Z(G)$ be the center of $G$. Associate with $G$ there is agraph $Gamma_G$ as follows: Take $Gsetminus Z(G)$ as vertices of$Gamma_G$ and joint two distinct vertices $x$ and $y$ whenever$yxneq yx$. $Gamma_G$ is called the non-commuting graph of $G$. In recent years many interesting works have been done in non-commutative graph of groups. Computing the clique...

Let G be a connected graph, nu(e) is the number of vertices of G lying closer to u and nv(e) is the number of vertices of G lying closer to v. Then the Szeged index of G is defined as the sum of nu(e)nv(e), over edges of G.. The PI index of G is a Szeged-like topological index defined as the sum of [mu(e)+ mv(e)], where mu(e) is the number of edges of G lying closer to u than to v, mv(e) is the...