Jason R. Vermette

activity

20132016

most citedThe graphs with all but two eigenvalues equal to

- 2

0

2 citations · 3 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2016★ 2 cited

The graphs with all but two eigenvalues equal to $- 2$ or $0$

Sebastian M. Cioaba, Willem H. Haemers, Jason R. Vermette

We determine all graphs for which the adjacency matrix has at most two eigenvalues (multiplicities included) not equal to $- 2$ , or $0$ , and determine which of these graphs are dete…

math.CO2015★ 1 cited

Maximizing the order of a regular graph of given valency and second eigenvalue

Sebastian M. Cioabă, Jack H. Koolen, Hiroshi Nozaki +1

From Alon and Boppana, and Serre, we know that for any given integer $k \geq 3$ and real number $λ < 2 k - 1$ , there are finitely many $k$ -regular graphs whose second largest eige…

math.CO2014

Notes on simplicial rook graphs

Andries E. Brouwer, Sebastian M. Cioabă, Willem H. Haemers +1

The simplicial rook graph $SR (m, n)$ is the graph of which the vertices are the sequences of nonnegative integers of length $m$ summing to $n$ , where two such sequences are ad…

math.CO2013

The graphs with all but two eigenvalues equal to $\pm 1$

Sebastian M. Cioabă, Willem H. Haemers, Jason Vermette +1

We determine all graphs whose adjacency matrix has at most two eigenvalues (multiplicities included) different from $\pm 1$ and decide which of these graphs are determined by their…

The graphs with all but two eigenvalues equal to −2 or 0

Maximizing the order of a regular graph of given valency and second eigenvalue

Notes on simplicial rook graphs

The graphs with all but two eigenvalues equal to ±1

The graphs with all but two eigenvalues equal to $- 2$ or $0$

The graphs with all but two eigenvalues equal to $\pm 1$