On Minimum Covering Partition Energy of a Graph

Sum Geometric Harmonic Means Index of Graphs

“…[16] A Friendship graph F p for an integer p ≥ 2, is the graph constructed by joining p copies of K 3 graph with common vertex.F p graph has n = 2p + 1 vertices and has m = 3p edges. For the friendship graph F p for an integer p ≥ 2, SG hm (F p ) = 4p √ p Proof.…”