Abstract
We consider regular graphs with small second largest eigenvalue (denoted by ?2). In particular, we determine all triangle-free regular graphs with ?2 ? ?2, all bipartite regular graphs with ?2 ? ?3, and all bipartite regular graphs of degree 3 with ?2 ? 2.
Highlights
The characteristic polynomial and the eigenvalues of a simple graph G are defined as the characteristic polynomial and the eigenvalues of its adjacency matrix
Regular graphs with small second largest eigenvalue often have high connectivity properties, and they are relevant to theoretical computer science, the designs of robust computer networks, the theory of error correcting codes, and to complexity theory [8]
In our previous work we considered regular graphs with λ2 ≤ 1
Summary
Regular graphs with small second largest eigenvalue often have high connectivity properties, and they are relevant to theoretical computer science, the designs of robust computer networks, the theory of error correcting codes, and to complexity theory [8]. We increase this√bound, and we completely determine all t√riangle-free regular graphs with λ2 ≤ 2, all bipartite regular graphs with λ2 ≤ 3, and all bipartite reflexive cubic (i.e. regular graphs of degree 3) graphs. We use both theoretical and computational methods; for the computer search we use the GENREG
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
