SearcharxivSearch

arXiv · 2501.06124

Zagreb indices of subgroup generating bipartite graph

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, 2p^2, 4p$, $4p^2$ and $p^n$; dihedral group of order $2p$ and $2p^2$; and dicyclic group of order $4p$ and $4p^2$ 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)$.

Explore related subjects

Keep this discovery

BibTeXRIS

Shrabani Das, Ahmad Erfanian, Rajat Kanti Nath. 2025-01-10. Zagreb indices of subgroup generating bipartite graph. https://arxiv.org/abs/2501.06124

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR