4 papers
Enumeration of Laplacian integral and {-1,0,1}-diagonalizable graphs
Nathaniel Johnston, Sarah Plosker, Luis M. B. Varona
A graph with Laplacian matrix is called Laplacian integral if the eigenvalues of are all integers, and it is called -diagonalizable if has a full set of eig…
A polynomial-time algorithm for recognizing high-bandwidth graphs
Luis M. B. Varona
An unweighted, undirected graph on nodes is said to have \emph{bandwidth} at most if its nodes can be labelled from to such that no two adjacent nodes have…
Efficient spectral bounds on the chromatic number of Hamming, Johnson, and Kneser graph powers
Finn A. Steinke, Luis M. B. Varona
We investigate spectral lower bounds on the chromatic number of Hamming graph powers , Johnson graph powers , and Kneser graph powers providi…
Generalizing the Cauchy-Schwarz inequality: Hadamard powers and tensor products
Nathaniel Johnston, Sarah Plosker, Charles Torrance +1
We explore and generalize a Cauchy-Schwarz-type inequality originally proved in [Electronic Journal of Linear Algebra 35, 156-180 (2019)]: $\|\mathbf{v}^2\|\|\mathbf{w}^2\| - \lang…