Vertex Szeged indices of P-2n

Cancan M., Naeem M., Baig A. Q., Gao W., Aslam A.

JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, vol.41, no.4, pp.991-1006, 2020 (ESCI) identifier

  • Publication Type: Article / Article
  • Volume: 41 Issue: 4
  • Publication Date: 2020
  • Doi Number: 10.1080/02522667.2020.1745381
  • Journal Name: JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES
  • Journal Indexes: Emerging Sources Citation Index (ESCI)
  • Page Numbers: pp.991-1006
  • Keywords: Vertex Szeged (Sz) index, Padmarkar-Ivan PIv index, Graph operations, Subdivision of graph, Total graph, TOPOLOGICAL INDEXES, PI INDEX, GRAPHS
  • Van Yüzüncü Yıl University Affiliated: Yes

Abstract

Let G=(V,E) be a simple connected graph, where V(G) and E(G) represent the vertex set and edge set of G respectively. For a graph the vertex Szeged index is equal to the product over all edges uv of G of the number of vertices which are not equidistant to vertices u and v. The vertex Padmarker-Ivan (PIv) index of a graph is the sum over all edges uv of G of the number of vertices which are not equidistant to vertices u and v. The aim of this paper is to compute and compare the vertex Szeged index and vertex Padmarker-Ivan (PIv) index of P2n+F Pn+1, where P2n+F Pn+1 represents four operation on P(2n)xP(n+1).