G. H. Fath-Tabar

  • Citations Per Year
Learn More
The vertex PI index of a graph G is the sum over all edges uv ∈ E(G) of the number of vertices which are not equidistant to u and v. In this paper, the extremal values of this new topological index are computed. In particular, we prove that for each n-vertex graph G, n(n− 1) ≤ PIv(G) ≤ n · b n 2 c · d n 2 e, where bxc denotes the greatest integer not(More)
  • 1