A nonregular analogue of conference graphs
type: Item
instance of: scholarly article
title: A nonregular analogue of conference graphs
zbMATH Open document ID: 0940.05043
published in: Journal of Combinatorial Theory. Series A
publication date: 1999-12-20T00:00:00Z
review text: A graph is called integral if all its eigenvalues are integers. The authors construct some examples of non-regular, non-bipartite, non-integral graphs with three distinct eigenvalues. A Bruck-Ryser type condition for such graphs is derived.
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1356444
zbMATH Keywords: conference graphs
zbMATH Keywords: integral graph
zbMATH Keywords: eigenvalues
zbMATH Keywords: Bruck-Ryser type condition
author: D. de Caen
author: Edwin R. Van Dam
author: Edward Spence
reviewed by: Dragoš Cvetković
MaRDI profile type: Publication
OpenAlex ID: W2123488273
Wikidata QID: Q56850759
cites work: Q5521595
cites work: Multiplicative cones - a family of three eigenvalue graphs
cites work: Q3218138
cites work: The spectra of complementary subgraphs in a strongly regular graph
cites work: Regular graphs with four eigenvalues
cites work: Nonregular graphs with three eigenvalues
cites work: Small regular graphs with four eigenvalues
cites work: Q3254327
cites work: On graphs with three eigenvalues
cites work: The existence of symmetric block designs
cites work: Research problems
DBLP publication ID: journals/jct/CaenDS99
DOI: 10.1006/JCTA.1999.2983
description: scientific article; zbMATH DE number 1356444