The vertex PI index and Szeged index of bridge graphs

AbstractRecently the vertex Padmakar–Ivan (PIv) 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

Computing the Szeged and PI Indices of VC5C7[p,q] and HC5C7[p,q] Nanotubes

In this paper we give a GAP program for computing the Szeged and the PI indices of any graph. Also we compute the Szeged and PI indices of VC5C7 [ p,q] and HC5C7 [ p,q] nanotubes by this program

A Method of Computing the PI Index of Benzenoid Hydrocarbons Using Orthogonal Cuts

The Padmakar-Ivan (PI) index of a graph G is defined as PI (G) = Σ [neu(e|G)+nev(e|G)], where for edge e=(u,v) are neu (e|G) the number of edges of G lying closer to u than v, and nev (e|G) is the number of edges of G lying closer to v than u and summation goes over all edges of G. The PI index is a Wiener-Szeged-like topological index developed very recently. In this paper we describe a method of computing PI index of benzenoid hydrocarbons (H) using orthogonal cuts. The method requires the finding of number of edges in the orthogonal cuts in a benzenoid system (H) and the edge number of H - a task significantly simpler than the calculation of PI index directly from its definition

BIOINFORMATICS TOOL AND MODEL DEVELOPMENT FOR STUDYING BIOLOGICAL NETWORKS AND PROTEIN-PROTEIN INTERACTIONS

Ph.DDOCTOR OF PHILOSOPH