Eigenvalue multiplicity in triangle-free graphs

DOI10.1016/j.laa.2015.12.012zbMath1329.05199OpenAlexW2199914311MaRDI QIDQ905739

Peter Rowlinson

Publication date: 28 January 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.12.012

zbMATH Keywords

eigenvaluebipartite graphstrongly regular graphtriangle-free graphstar complement

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1 ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On eigenvalue multiplicity and the girth of a graph
• A table of connected graphs on six vertices
• Star complements in regular graphs: old and new results
• On multiple eigenvalues of trees
• Nonregular graphs with three eigenvalues
• On bipartite graphs with complete bipartite star complements
• Eigenvalue multiplicity in cubic graphs
• An example of using star complements in classifying strongly regular graphs
• ON THE MULTIPLICITIES OF GRAPH EIGENVALUES
• On graphs with complete bipartite star complements

This page was built for publication: Eigenvalue multiplicity in triangle-free graphs