Published in

AOSIS, Applicable Analysis and Discrete Mathematics, 1(11), p. 74-80

DOI: 10.2298/aadm161111033r

Links

Tools

Export citation

Search in Google Scholar

More on graphs with just three distinct eigenvalues

Journal article published in 2017 by Peter Rowlinson
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Orange circle
Published version: archiving restricted
Data provided by SHERPA/RoMEO

Abstract

Let G be a connected non-regular non-bipartite graph whose adjacency matrix has spectrum p,?(k),?(l), where k,l ? N and p > ? > ?. We show that if ? is non-main then ?(G) ? 1 + ? - ??, with equality if and only if G is of one of three types, derived from a strongly regular graph, a symmetric design or a quasi-symmetric design (with appropriate parameters in each case).