Article ID Journal Published Year Pages File Type
418829 Discrete Applied Mathematics 2009 7 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
The vertex PI index and Szeged index of bridge graphs
Authors
, ,