Asymptotic lower bounds on smallest eigenvalues of Hamming graphs for small j, with exact asymptotic determination and matching quantum chromatic number bounds for quaternary Cayley graphs.
Meenakshi McNamara
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Optimization of inertia-type bounds for k-independence and distance-k chromatic numbers of graphs is polynomial-time solvable for fixed k.
citing papers explorer
-
On the Smallest Eigenvalues and Quantum Chromatic Numbers of Hamming Graphs and Generalizations
Asymptotic lower bounds on smallest eigenvalues of Hamming graphs for small j, with exact asymptotic determination and matching quantum chromatic number bounds for quaternary Cayley graphs.
-
Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers
Optimization of inertia-type bounds for k-independence and distance-k chromatic numbers of graphs is polynomial-time solvable for fixed k.