The vertex PI index and Szeged index of bridge graphs

Recently the vertex Padmakar–Ivan (PIvPIv) index of a graph GG was introduced as the sum over all edges e=uve=uv of GG of the number of vertices which are not equidistant to the vertices uu and vv. 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.