Spectral radius and second largest eigenvalues of power graphs of finite groups

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Mondal, Priti Prasanna, Mir, Basit Auyoob, Atik, Fouzul
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866915824865902592
author Mondal, Priti Prasanna
Mir, Basit Auyoob
Atik, Fouzul
author_facet Mondal, Priti Prasanna
Mir, Basit Auyoob
Atik, Fouzul
contents Consider a group $\mathbb{G}$ and construct its power graph, whose vertex set consists of the elements of $\mathbb{G}$. Two distinct vertices (elements) are adjacent in the graph if and only if one element can be expressed as an integral power of the other. In this article, we improved the bounds of the spectral radius of the power graphs of the cyclic group $C_{n}$, the dihedral group $\mathcal{D}_{2n}$, and the dicyclic group $\mathcal{Q}_{4n}$. For $n\neq p^{m},$ the power graph of the cyclic group $C_{n}$ is not a complete multipartite graph. We find the second largest eigenvalue bounds of the same with the clique number. In some cases, we find the bounds are exact if and only if they belong to a particular family of graphs. Lastly, we work on the distance spectral radius of the power graphs of the same groups
format Preprint
id arxiv_https___arxiv_org_abs_2411_18244
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Spectral radius and second largest eigenvalues of power graphs of finite groups
Mondal, Priti Prasanna
Mir, Basit Auyoob
Atik, Fouzul
Spectral Theory
Consider a group $\mathbb{G}$ and construct its power graph, whose vertex set consists of the elements of $\mathbb{G}$. Two distinct vertices (elements) are adjacent in the graph if and only if one element can be expressed as an integral power of the other. In this article, we improved the bounds of the spectral radius of the power graphs of the cyclic group $C_{n}$, the dihedral group $\mathcal{D}_{2n}$, and the dicyclic group $\mathcal{Q}_{4n}$. For $n\neq p^{m},$ the power graph of the cyclic group $C_{n}$ is not a complete multipartite graph. We find the second largest eigenvalue bounds of the same with the clique number. In some cases, we find the bounds are exact if and only if they belong to a particular family of graphs. Lastly, we work on the distance spectral radius of the power graphs of the same groups
title Spectral radius and second largest eigenvalues of power graphs of finite groups
topic Spectral Theory
url https://arxiv.org/abs/2411.18244