A note on order and eigenvalue multiplicity of strongly regular graphs

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Mohammadian, A., & Tayfeh-Rezaie, B. (2015). A note on order and eigenvalue multiplicity of strongly regular graphs. In Algebraic Design Theory and Hadamard Matrices: ADTHM, Lethbridge, Alberta, Canada, July 2014 (Vol. 133, pp. 209–212). Springer International Publishing. https://doi.org/10.1007/978-3-319-17729-8_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free