The Product Connectivity Banhatti Index of A Graph

Abstract

Let G = (V, E) be a connected graph with vertex set V (G) and edge set E(G). The product connectivity Banhatti index of a graph G is defined as, PB(G)=∑ue1dG(u)dG(e)$PB(G) = \sum\nolimits_{ue} {{1 \over {\sqrt {{d_G}(u){d_G}(e)} }}}$ where ue means that the vertex u and edge e are incident in G. In this paper, we determine P B(G) of some standard classes of graphs. We also provide some relationship between P B(G) in terms of order, size, minimum / maximum degrees and minimal non-pendant vertex degree. In addition, we obtain some bounds on P B(G) in terms of Randić, Zagreb and other degree based topological indices of G.

Keywords

• randić index
• zagreb indices
• banhatti indices
• product connectivity banhatti index
• 05c05
• 05c012
• 05c35