Abstract
The Padmakar-Ivan (PI) index of a graph G is the sum over all edges uv of G of the number of edges which are not equidistant from the vertices u and v. In this paper, we compute the PI index of bridge and chain graphs. Using these formulas, the PI indices of several graphs are computed.
| Original language | English |
|---|---|
| Pages (from-to) | 723-734 |
| Number of pages | 12 |
| Journal | Match |
| Volume | 61 |
| Issue number | 3 |
| State | Published - 2009 |
ASJC Scopus subject areas
- General Chemistry
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics