Cancan, MuratNaeem, MuhammadBaig, Abdul QudairGao, WeiAslam, Aneela2025-05-102025-05-1020200252-26672169-010310.1080/02522667.2020.1745381https://doi.org/10.1080/02522667.2020.1745381https://hdl.handle.net/20.500.14720/13996Naeem, Dr. Muhammad/0000-0002-8132-1580Let 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).eninfo:eu-repo/semantics/closedAccessVertex Szeged (Sz) IndexPadmarkar-Ivan Piv IndexGraph OperationsSubdivision Of GraphTotal GraphArticle414N/AN/A9911006WOS:000551469300013