A new condition for distance-regular graphs

J.H. Koolen

doi:10.1016/0195-6698(92)90068-B

A new condition for distance-regular graphs

J.H. Koolen

Department of Mathematics and Computer Science

Research output: Contribution to journal › Article › Academic › peer-review

6 Citations (Scopus)

Abstract

We find that certain distance-regular graphs must contain Pappus subgraphs and, as a corollary, are able to rule out the existence of the last bipartite distance-regular graph of diameter 6 in the tables of [2] for which the existence was still undecided.

Original language	English
Pages (from-to)	63-64
Number of pages	2
Journal	European Journal of Combinatorics
Volume	13
Issue number	1
DOIs	https://doi.org/10.1016/0195-6698(92)90068-B
Publication status	Published - 1992

Access to Document

10.1016/0195-6698(92)90068-B

Fingerprint Dive into the research topics of 'A new condition for distance-regular graphs'. Together they form a unique fingerprint.

Cite this

@article{c3edd47e28414d35ae915e15b5e58aa4,

title = "A new condition for distance-regular graphs",

abstract = "We find that certain distance-regular graphs must contain Pappus subgraphs and, as a corollary, are able to rule out the existence of the last bipartite distance-regular graph of diameter 6 in the tables of [2] for which the existence was still undecided.",

author = "J.H. Koolen",

year = "1992",

doi = "10.1016/0195-6698(92)90068-B",

language = "English",

volume = "13",

pages = "63--64",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - A new condition for distance-regular graphs

AU - Koolen, J.H.

PY - 1992

Y1 - 1992

N2 - We find that certain distance-regular graphs must contain Pappus subgraphs and, as a corollary, are able to rule out the existence of the last bipartite distance-regular graph of diameter 6 in the tables of [2] for which the existence was still undecided.

AB - We find that certain distance-regular graphs must contain Pappus subgraphs and, as a corollary, are able to rule out the existence of the last bipartite distance-regular graph of diameter 6 in the tables of [2] for which the existence was still undecided.

U2 - 10.1016/0195-6698(92)90068-B

DO - 10.1016/0195-6698(92)90068-B

M3 - Article

VL - 13

SP - 63

EP - 64

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

IS - 1

ER -