9 citations
Showing math.COShow all
2 papers · 1 filter
math.CO2005★ 1 cited
Taut distance-regular graphs and the subconstituent algebra
Mark S. MacLean, Paul Terwilliger
We consider a bipartite distance-regular graph with diameter at least 4 and valency at least 3. We obtain upper and lower bounds for the local eigenvalues of in ter…
math.CO2003★ 9 cited
Complexes of graph homomorphisms
Eric Babson, Dmitry N. Kozlov
is a polyhedral complex defined for any two undirected graphs and . This construction was introduced by Lovász to give lower bounds for chromatic numbers of graph…