On graphs with exactly one eigenvalue less than -1

Miroslav Petrovic. On graphs with exactly one eigenvalue less than -1. Journal of Combinatorial Theory, Series A, 52(1):102-112, 1991. [doi]

@article{Petrovic91,
  title = {On graphs with exactly one eigenvalue less than -1},
  author = {Miroslav Petrovic},
  year = {1991},
  doi = {10.1016/0095-8956(91)90096-3},
  url = {http://dx.doi.org/10.1016/0095-8956(91)90096-3},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Petrovic91},
  cites = {0},
  citedby = {0},
  journal = {Journal of Combinatorial Theory, Series A},
  volume = {52},
  number = {1},
  pages = {102-112},
}