Zagreb indices of subgroup generating bipartite graph
arXiv:2501.06124
Abstract
Let be a group and be the set of all subgroups of . The subgroup generating bipartite graph defined on is a bipartite graph whose vertex set is partitioned into two sets and , and two vertices and are adjacent if is generated by and . In this paper, we deduce expressions for first and second Zagreb indices of and obtain a condition such that satisfy Hansen-Vuki{Ä}evi{Ä} conjecture [Hansen, P. and Vuki{Ä}evi{Ä}, D. Comparing the Zagreb indices, {\em Croatica Chemica Acta}, \textbf{80}(2), 165-168, 2007]. It is shown that satisfies Hansen-Vuki{Ä}evi{Ä} conjecture if is a cyclic group of order , and ; dihedral group of order and ; and dicyclic group of order and for any prime . While computing Zagreb indices of we have computed for all for the above mentioned groups. Using these information we also compute Randic Connectivity index, Atom-Bond Connectivity index, Geometric-Arithmetic index, Harmonic index and Sum-Connectivity index of .
17 pages