Open AccessVertex and edge Co-PI indices of bridge graphs
Author(s) -
Sharmila Devi,
V. Kaladevi
Publication year - 2016
Publication title -
international journal of advanced mathematical sciences
Language(s) - English
Resource type - Journals
ISSN - 2307-454X
DOI - 10.14419/ijams.v6i1.8398
Subject(s) - vertex (graph theory) , combinatorics , pi , mathematics , neighbourhood (mathematics) , graph , bound graph , geometry , graph power , line graph , mathematical analysis
The Co-PI index of a graph G is denoted by Co-PI(G) and is defined as Co-PI(G is the number of vertices of G whose distance to the vertex u is less than the distance to the vertex v in G. Similarly, the edge Co-PI index of G is defined as Co-PIe(G) is number of edges of G whose distance to the vertex u is less than the distance to the vertex v in G. In this paper, the upper bounds for the Co-PI and edge Co-PI indices of bridge graph are obtained.