Distance-regularised graphs are distance-regular or distance-biregular

Citations of this article
Mendeley users who have this article in their library.
Get full text


One problem with the theory of distance-regular graphs is that it does not apply directly to the graphs of generalised polygons. In this paper we overcome this difficulty by introducing the class of distance-regularised graphs, a natural common generalisation. These graphs are shown to either be distance-regular or fall into a family of bipartite graphs called distance-biregular. This family includes the generalised polygons and other interesting graphs. Despite this increased generality we are also able to extend much of the basic theory of distance-regular graphs to our wider class of graphs. © 1987.




Godsil, C. D., & Shawe-Taylor, J. (1987). Distance-regularised graphs are distance-regular or distance-biregular. Journal of Combinatorial Theory, Series B, 43(1), 14–24. https://doi.org/10.1016/0095-8956(87)90027-X

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free