Dual bipartite Q-polynomial distance-regular graphs

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We classify the dual bipartite Q-polynomial distance-regular graphs of diameter d ≥ 5 which are not bipartite. Results of Curtin and Nomura give a classification of the dual bipartite Q-polynomial distance-regular graphs of diameter d ≥ 6 which are bipartite. This completes a classification of the dual bipartite Q-polynomial distance-regular graphs of diameter d ≥ 6. © 1996 Academic Press Limited.

Cite

CITATION STYLE

APA

Dickie, G. A., & Terwilliger, P. M. (1996). Dual bipartite Q-polynomial distance-regular graphs. European Journal of Combinatorics, 17(7), 613–623. https://doi.org/10.1006/eujc.1996.0052

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