On distance regular graphs with $c_i=b_1$

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

1 Downloads (Pure)

Abstract

Let Γ be a distance regular graph with intersection array{b0, b1, ..., bd−1}: c1, c2, ..., cd. We show that bi ⩽ l whenever ci = b1.

@article{2096f6f9199d4925982de8a7fadf6e68,

title = "On distance regular graphs with \$c\_i=b\_1\$",

abstract = "Let Γ be a distance regular graph with intersection array\{b0, b1, ..., bd−1\}: c1, c2, ..., cd. We show that bi ⩽ l whenever ci = b1.",

author = "E.W. Lambeck",

year = "1993",

doi = "10.1016/0012-365X(93)90524-W",

language = "English",

volume = "113",

pages = "275--276",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "1-3",

}

TY - JOUR

T1 - On distance regular graphs with $c_i=b_1$

AU - Lambeck, E.W.

PY - 1993

Y1 - 1993

N2 - Let Γ be a distance regular graph with intersection array{b0, b1, ..., bd−1}: c1, c2, ..., cd. We show that bi ⩽ l whenever ci = b1.

AB - Let Γ be a distance regular graph with intersection array{b0, b1, ..., bd−1}: c1, c2, ..., cd. We show that bi ⩽ l whenever ci = b1.

U2 - 10.1016/0012-365X(93)90524-W

DO - 10.1016/0012-365X(93)90524-W

M3 - Article

SN - 0012-365X

VL - 113

SP - 275

EP - 276

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -