A nonregular analogue of conference graphs

DOI10.1006/jcta.1999.2983zbMath0940.05043OpenAlexW2123488273WikidataQ56850759 ScholiaQ56850759MaRDI QIDQ1806225

Spence, Edward, van Dam, Edwin R., Dominique De Caen

Publication date: 20 December 1999

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b6587b6d5682694d0031bcbfafff201040ccd89d

zbMATH Keywords

eigenvaluesintegral graphBruck-Ryser type conditionconference graphs

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Biregular graphs with three eigenvalues ⋮ On regular graphs with four distinct eigenvalues ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ Combinatorial designs with two singular values. I: Uniform multiplicative designs ⋮ On 2-equitable graphs ⋮ Graphs with two main and two plain eigenvalues ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ A note on graphs whose signless Laplacian has three distinct eigenvalues ⋮ Combinatorial designs with two singular values. II: Partial geometric designs ⋮ Universal adjacency matrices with two eigenvalues ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity ⋮ Open problems in the spectral theory of signed graphs ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of symmetric block designs
• Multiplicative cones - a family of three eigenvalue graphs
• The spectra of complementary subgraphs in a strongly regular graph
• Nonregular graphs with three eigenvalues
• On graphs with three eigenvalues
• Small regular graphs with four eigenvalues
• Regular graphs with four eigenvalues
• Research problems