75 citations · 175 across the 17 of their papers we have counts for
Showing 2016 · math.COShow all
3 papers · 2 filters
math.CO2016
Graph Homomorphisms via Vector Colorings
Chris Godsil, David E. Roberson, Brendan Rooney +2
In this paper we study the existence of homomorphisms using semidefinite programming. Specifically, we use the vector chromatic number of a graph, defined as the smallest…
math.CO2016
Note on von Neumann and Rényi entropies of a Graph
Michael Dairyko, Leslie Hogben, Jephian C. -H. Lin +4
We conjecture that all connected graphs of order have von Neumann entropy at least as great as the star and prove this for almost all graphs of order . We show t…
math.CO2016
Homomorphisms of Strongly Regular Graphs
David E. Roberson
We prove that if and are primitive strongly regular graphs with the same parameters and is a homomorphism from to , then is either an isomorphism or a colori…