On the limit points of the smallest eigenvalues of regular graphs

From MaRDI portal
Publication:438894

DOI10.1007/S10623-011-9575-0zbMATH Open1245.05090arXiv1105.5490OpenAlexW1996856760MaRDI QIDQ438894FDOQ438894

Hyonju Yu

Publication date: 31 July 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In this paper, we give infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [1sqrt2,2) and also infinitely many examples of (non-isomorphic) connected k-regular graphs with smallest eigenvalue in half open interval [alpha1,1sqrt2) where alpha1 is the smallest root(approx2.4812) of the polynomial x3+2x22x2. From these results, we determine the largest and second largest limit points of smallest eigenvalues of regular graphs less than -2. Moreover we determine the supremum of the smallest eigenvalue among all connected 3-regular graphs with smallest eigenvalue less than -2 and we give the unique graph with this supremum value as its smallest eigenvalue.


Full work available at URL: https://arxiv.org/abs/1105.5490





Cites Work


Cited In (12)






This page was built for publication: On the limit points of the smallest eigenvalues of regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438894)