6 papers · 1 filter
Total Conformal Rigidity in Graphs
Henrique Assumpção, Gabriel Coutinho, Chris Godsil
We introduce and study a generalization of conformal rigidity for graphs. A graph is -conformally rigid if the uniform edge weights simultaneously maximize the sum of the sm…
Quantum walks on finite and bounded infinite graphs
Chris Godsil, Steve Kirkland, Sarojini Mohapatra +2
A weighted graph with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in . I…
On cores of distance-regular graphs
Annemarie Geertsema, Chris Godsil, Krystal Guo
We look at the question of which distance-regular graphs are core-complete, meaning they are isomorphic to their own core or have a complete core. We build on Roberson's homomorphi…
Degree-Similar Graphs
Chris Godsil, Wanting Sun
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of . If and are graphs with respective adjacency matri…
Oriented or signed Cayley graphs with all eigenvalues integer multiples of
Chris Godsil, Xiaohong Zhang
Let be a finite abelian group. Bridges and Mena characterized the Cayley graphs of that have only integer eigenvalues. Here we consider the adjacency matrix of a…
Quantum independence and chromatic numbers
Chris Godsil, Mariia Sobchuk
We construct a new graph on 120 vertices whose quantum and classical independence numbers are different. At the same time, we construct an infinite family of graphs whose quantum c…