Papers
Topics
Authors
Recent
Search
2000 character limit reached

Zagreb indices of subgroup generating bipartite graph

Published 10 Jan 2025 in math.GR | (2501.06124v1)

Abstract: Let $G$ be a group and $L(G)$ be the set of all subgroups of $G$. The subgroup generating bipartite graph $\mathcal{B}(G)$ defined on $G$ is a bipartite graph whose vertex set is partitioned into two sets $G \times G$ and $L(G)$, and two vertices $(a, b) \in G \times G$ and $H \in L(G)$ are adjacent if $H$ is generated by $a$ and $b$. In this paper, we deduce expressions for first and second Zagreb indices of $\mathcal{B}(G)$ and obtain a condition such that $\mathcal{B}(G)$ satisfy Hansen-Vuki{\v{c}}evi{\'c} conjecture [Hansen, P. and Vuki{\v{c}}evi{\'c}, D. Comparing the Zagreb indices, {\em Croatica Chemica Acta}, \textbf{80}(2), 165-168, 2007]. It is shown that $\mathcal{B}(G)$ satisfies Hansen-Vuki{\v{c}}evi{\'c} conjecture if $G$ is a cyclic group of order $2p, 2p2, 4p$, $4p2$ and $pn$; dihedral group of order $2p$ and $2p2$; and dicyclic group of order $4p$ and $4p2$ for any prime $p$. While computing Zagreb indices of $\mathcal{B}(G)$ we have computed $\deg_{\mathcal{B}(G)}(H)$ for all $H \in L(G)$ 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 $\mathcal{B}(G)$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.