in this paper, at first we mention to some results related to pi and vertex co-pi indices and then we introduce the edge versions of co-pi indices. then, we obtain some properties about these new indices.

In this paper, at first we mention to some results related to PI and vertex Co-PI indices and then we introduce the edge versions of Co-PI indices. Then, we obtain some properties about these new indices.

in this paper, at first we introduce a new index with the name co-pi index and obtain someproperties related this new index. then we compute this new index for tuc4c8(r) nanotubes.

The edge version of Szeged index and vertex version of PI index are defined very recently. They are similar to edge-PI and vertex-Szeged indices, respectively. The different versions of Szeged and PIindices are the most important topological indices defined in Chemistry. In this paper, we compute the edge-Szeged and vertex-PIindices of some important classes of benzenoid systems.

Recently the vertex Padmakar–Ivan (PI v) index of a graph G was introduced as the sum over all edges e = uv of G of the number of vertices which are not equidistant to the vertices u and v. In this paper the vertex PI index and Szeged index of bridge graphs are determined. Using these formulas, the vertex PI indices and Szeged indices of several graphs are computed.

A lot of research and various techniques have been devoted for finding the topological descriptor Wiener index, but most of them deal with only particular cases. There exist three regular 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 compute the Wiener index and demonstrate th...

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...

let g and h be two graphs. the corona product g o h is obtained by taking one copy of gand |v(g)| copies of h; and by joining each vertex of the i-th copy of h to the i-th vertex of g,i = 1, 2, …, |v(g)|. in this paper, we compute pi and hyper–wiener indices of the coronaproduct of graphs.

in this paper, we present some inequalities for the co-pi index involving the some topological indices, the number of vertices and edges, and the maximum degree. after that, we give a result for trees. in addition, we give some inequalities for the largest eigenvalue of the co-pi matrix of g.