Abstract
Recently the vertex Padmakar-Ivan (P Iv) index of a graph G was introduced as the sum over all edges e = u v of G of the number of vertices which are not equidistant to the vertices u and v. 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.
Original language | English |
---|---|
Pages (from-to) | 1600-1606 |
Number of pages | 7 |
Journal | Discrete Applied Mathematics |
Volume | 157 |
Issue number | 7 |
DOIs | |
State | Published - 6 Apr 2009 |
Keywords
- Graph invariant
- Szeged index
- Vertex PI index
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics