The graphs with all but two eigenvalues equal to ±1

S.M. Cioaba, W. H. Haemers, Jason R. Vermette, Wiseley Wong

Research output: Contribution to journal › Article › Scientific › peer-review

47 Citations (Scopus)

Original language	English
Pages (from-to)	887-897
Journal	Journal of Algebraic Combinatorics
Volume	41
Issue number	3
DOIs	https://doi.org/10.1007/s10801-014-0557-y
Publication status	Published - May 2015

Access to Document

@article{2d2b630975d94c328b7435caa790ac60,

title = "The graphs with all but two eigenvalues equal to ±1",

author = "S.M. Cioaba and Haemers, {W. H.} and Vermette, {Jason R.} and Wiseley Wong",

year = "2015",

month = may,

doi = "10.1007/s10801-014-0557-y",

language = "English",

volume = "41",

pages = "887--897",

journal = "Journal of Algebraic Combinatorics",

issn = "0925-9899",

publisher = "Springer Netherlands",

number = "3",

}

TY - JOUR

T1 - The graphs with all but two eigenvalues equal to ±1

AU - Cioaba, S.M.

AU - Haemers, W. H.

AU - Vermette, Jason R.

AU - Wong, Wiseley

PY - 2015/5

Y1 - 2015/5

U2 - 10.1007/s10801-014-0557-y

DO - 10.1007/s10801-014-0557-y

M3 - Article

SN - 0925-9899

VL - 41

SP - 887

EP - 897

JO - Journal of Algebraic Combinatorics

JF - Journal of Algebraic Combinatorics

IS - 3

ER -