Brendan Rooney

activity

20152026

most citedRegular Graphs of Degree at most Four that Allow Two Distinct Eigenvalues

1 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing 2015Show all

2 papers · 1 filter

math.CO2015

Universal completability, least eigenvalue frameworks, and vector colorings

Chris Godsil, David E. Roberson, Brendan Rooney +2

An embedding $i \mapsto p_{i} \in R^{d}$ of the vertices of a graph $G$ is called universally completable if the following holds: For any other embedding $i\mapsto q_i~\in \mat…

math.CO2015

Hardness of Computing Clique Number and Chromatic Number For Cayley Graphs

Chris Godsil, Brendan Rooney

Computing the clique number and chromatic number of a general graph are well-known NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness…