On cores of distance-regular graphs

Abstract

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 homomorphism matrix approach by which method he proved the Cameron-Kazanidis conjecture that strongly regular graphs are core-complete. We develop the theory of the homomorphism matrix for distance-regular graphs of diameter $d$. We derive necessary conditions on the cosines of a distance-regular graph for it to admit an endomorphism into a subgraph of smaller diameter $e<d$. As a consequence of these conditions, we show that if $X$ is a primitive distance-regular graph where the subgraph induced by the set of vertices furthest away from a vertex $v$ is connected, any retraction of $X$ onto a diameter-$d$ subgraph must be an automorphism, which recovers Roberson's result for strongly regular graphs as a special case for diameter $2$. We illustrate the application of our necessary conditions through computational results. We find that no antipodal, non-bipartite distance-regular graphs of diameter 3, with degree at most $50$ admits an endomorphism to a diameter 2 subgraph. We also give many examples of intersection arrays of primitive distance-regular graphs of diameter $3$ which are core-complete. Our methods include standard tools from the theory of association schemes, particularly the spectral idempotents. Keywords: algebraic graph theory, distance-regular graphs, association schemes, graph homomorphisms

Figures (1)

• Figure 1: Geodetic vertices $u$ and $v$ are at distance $e$ in a distance-regular graph $X$ and the $\phi$-partition of $\Gamma_1(v)$ with respect to $u$.

Theorems & Definitions (27)

• Conjecture 1.2
• Theorem 2.1
• Example 2.2
• Lemma 2.3
• Lemma 3.1
• proof
• Theorem 3.2
• Lemma 3.3
• proof
• Lemma 3.4