#### Filter Results:

- Full text PDF available (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Supalak Sumalroj, Chalermpong Worawannotai
- Electr. J. Comb.
- 2016

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.

- Andries E. Brouwer, Supalak Sumalroj, Chalermpong Worawannotai
- Australasian J. Combinatorics
- 2016

Locally, a distance-regular graph with ‘μ = 2’ carries the structure of a partial linear space. Using this, we show that there are no distanceregular graphs with intersection array {27, 20, 10; 1, 2, 18} or {36, 28, 4; 1, 2, 24} (on, respectively, 448 or 625 vertices).

- ‹
- 1
- ›