Abstract
We prove that a distance-regular graph with intersection array {22; 16; 5; 1; 2; 20} does not exist. To prove this, we assume that such a graph exists and derive some combinatorial properties of its local graph. Then we construct a partial linear space from the local graph to display the contradiction.
Author supplied keywords
Cite
CITATION STYLE
APA
Sumalroj, S., & Worawannotai, C. (2016). The nonexistence of a distance-regular graph with intersection array {22,16,5;1,2,20}. Electronic Journal of Combinatorics, 23(1). https://doi.org/10.37236/5486
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free