On the minimum spectral radius of connected graphs of given order and size

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Cioabă, Sebastian M., Gupta, Vishal, Marques, Celso
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909517526073344
author Cioabă, Sebastian M.
Gupta, Vishal
Marques, Celso
author_facet Cioabă, Sebastian M.
Gupta, Vishal
Marques, Celso
contents In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of vertices $n$ and number of edges $e$, the graphs having minimum spectral radius (the minimizer graphs) must be almost regular, meaning that the difference between their maximum degree and their minimum degree is at most one. In this paper, we answer Hong's question positively for various values of $n$ and $e$ and in several cases, we determined the graphs with minimum spectral radius.
format Preprint
id arxiv_https___arxiv_org_abs_2405_15046
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle On the minimum spectral radius of connected graphs of given order and size
Cioabă, Sebastian M.
Gupta, Vishal
Marques, Celso
Combinatorics
Discrete Mathematics
05C50, 15A18
In this paper, we study a question of Hong from 1993 related to the minimum spectral radii of the adjacency matrices of connected graphs of given order and size. Hong asked if it is true that among all connected graphs of given number of vertices $n$ and number of edges $e$, the graphs having minimum spectral radius (the minimizer graphs) must be almost regular, meaning that the difference between their maximum degree and their minimum degree is at most one. In this paper, we answer Hong's question positively for various values of $n$ and $e$ and in several cases, we determined the graphs with minimum spectral radius.
title On the minimum spectral radius of connected graphs of given order and size
topic Combinatorics
Discrete Mathematics
05C50, 15A18
url https://arxiv.org/abs/2405.15046