%0 Journal Article
%T PI Index of Bicyclic Graphs
%J Communications in Combinatorics and Optimization
%I Azarbaijan Shahid Madani University
%Z 2538-2128
%A SC, Manju
%A K, Somasundaram
%D 2024
%\ 09/01/2024
%V 9
%N 3
%P 425-436
%! PI Index of Bicyclic Graphs
%K PI index
%K Unicyclic graphs
%K bicyclic graphs
%K Extremal values
%R 10.22049/cco.2023.27817.1360
%X The PI index of a graph $G$ is given by $PI(G)=\sum_{e\in E(G)}(\left|V(G)\right|-N_G(e))$, where $N_G(e)$ is the number of equidistant vertices for the edge $e$. Various topological indices of bicyclic graphs have already been calculated. In this paper, we obtained the exact value of the PI index of bicyclic graphs. We also explore the extremal graphs among all bicyclic graphs with respect to the PI index. Furthermore, we calculate the PI index of a cactus graph and determine the extremal values of the PI index among cactus graphs.
%U http://comb-opt.azaruniv.ac.ir/article_14514_16693d8f0f62ff339f2efb5cc772d1df.pdf