×

A note on order and eigenvalue multiplicity of strongly regular graphs. (English) Zbl 1329.05312

Colbourn, Charles J. (ed.), Algebraic design theory and Hadamard matrices. ADTHM, Lethbridge, Alberta, Canada, July 8–11, 2014. Selected papers based on the presentations at the workshop and at the workshop on algebraic design theory with Hadamard matrices: applications, current trends and future directions, Banff International Research Station, Alberta, Canada, July 11–13, 2014. Cham: Springer (ISBN 978-3-319-17728-1/hbk; 978-3-319-17729-8/ebook). Springer Proceedings in Mathematics & Statistics 133, 209-212 (2015).
Summary: In this note, we consider a well-known upper bound for the order of a strongly regular graph in terms of the multiplicity of a non-principal eigenvalue of its adjacency matrix.
For the entire collection see [Zbl 1329.05003].

MSC:

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

References:

[1] Brouwer, A. E.; Haemers, W. H., Spectra of Graphs (2012), Springer, New York: Universitext, Springer, New York · Zbl 1231.05001 · doi:10.1007/978-1-4614-1939-6
[2] Chang, L. C., The uniqueness and nonuniqueness of the triangular association schemes, Sci. Record., 3, 604-613 (1959) · Zbl 0089.15102
[3] Elzinga, R.J.: Strongly regular graphs: values of λ and μ for which there are only finitely many feasible (v, k, λ, μ). Electron. J. Linear Algebra 10, 232-239 (2003) · Zbl 1033.05101
[4] Neumaier, A.: New inequalities for the parameters of an association scheme. In: Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol. 885, pp. 365-367. Springer, Berlin (1981) · Zbl 0479.05047
[5] Scott, Jr., L.L.: A condition on Higman’s parameters. Notices Am. Math. Soc. 20 (A-97), Abstract 701-20-45 (1973)
[6] Seidel, J.J.: Strongly regular graphs. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol. 38, pp. 157-180. Cambridge University Press, Cambridge (1979) · Zbl 0431.05018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.