Geometric Distance-Regular Graphs

A non-complete distance-regular graph \(\Gamma\) is called geometric if there exists a set of Delsarte cliques \(\mathcal{C}\) such that each edge of \(\Gamma\) lies in a unique clique in \(\mathcal{C}\). In this talk, the speaker introduces distance-regular graphs and geometric distance-regular graphs. In particular, the speaker gives a diameter bound for geometric distance-regular graphs with smallest eigenvalue \(-m\). Moreover, the speaker characterizes geometric distance-regular graphs with smallest eigenvalue at least \(-4\).

Event Topic

Discrete Applied Math Seminar