A nonregular analogue of conference graphs (Q1806225): Difference between revisions

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.