A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\)

DOI10.4171/PM/1942zbMath1297.05142MaRDI QIDQ399386

Paula Rama, Inês Barbedo, Dragos Cvetković, Slobodan K. Simic, Domingos Moreira Cardoso

Publication date: 19 August 2014

Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

zbMATH Keywords

posetsexceptional graphsspectral graph theory

Mathematics Subject Classification ID

Partial orders, general (06A06) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (1)

Graphs with least eigenvalue \(-2\): ten years on

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral results on graphs with regularity constraints
• Spectral results on regular graphs with \((k,\tau)\)-regular sets
• Eigenvalue bounds for independent sets
• The maximal exceptional graphs
• Equitable bipartitions of graphs and related results
• Interlacing eigenvalues and graphs
• Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
• Graphs with least eigenvalue \(-2\): The star complement technique

This page was built for publication: A recursive construction of the regular exceptional graphs with least eigenvalue \(-2\)