The Co-PI Index of Some Compound Graphs

Xuehong Yin1, Hong Bian1, Haizheng Yu2
1School of Mathematical Science, Xinjiang Normal University, Urumgai, Xinjiang, 830054, P. R. China
2College of Mathematics and System Sciences, Xinjiang University, Urumgi, Xinjiang, 830046, P. R. China

Abstract

Let \(G\) be a graph and \(u\) be a vertex of \(G\). The transmission index of \(u\) in \(G\), denoted by \(T_G(u)\), is the sum of distances from \(u\) to all the other vertices in graph \(G\), i.e., \(T(u) = T_G(u) = \sum_{v \in V} d_G(u,v)\). The Co-PI index [1] is defined as \(Co\text{-}PI(G) = \sum_{uv \in E(G)} |T(u) – T(v)|\). In this paper, we give some upper bounds for the Co-PI indices of the join, composition, disjunction, symmetric difference, and corona graph \(G_1 \circ G_2\).