3-bounded property in a triangle-free distance-regular graph

Yeh jong Pan; Chih-wen Weng

doi:10.1016/j.ejc.2007.10.002

3-bounded property in a triangle-free distance-regular graph

Yeh jong Pan^*, Chih-wen Weng

^*Corresponding author for this work

Department of Applied Mathematics

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

4 Scopus citations

Abstract

Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a₁ = 0 and a₂ ≠ 0. We show that Γ is 3-bounded in the sense of the article [C. Weng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229].

Original language	English
Pages (from-to)	1634-1642
Number of pages	9
Journal	European Journal of Combinatorics
Volume	29
Issue number	7
DOIs	https://doi.org/10.1016/j.ejc.2007.10.002
State	Published - Oct 2008

Access to Document

10.1016/j.ejc.2007.10.002

Cite this

@article{10f17f30ed014ca2b31ec4bf94f3b31b,

title = "3-bounded property in a triangle-free distance-regular graph",

abstract = "Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 ≠ 0. We show that Γ is 3-bounded in the sense of the article [C. Weng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229].",

author = "Pan, {Yeh jong} and Chih-wen Weng",

year = "2008",

month = oct,

doi = "10.1016/j.ejc.2007.10.002",

language = "English",

volume = "29",

pages = "1634--1642",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press",

number = "7",

}

TY - JOUR

T1 - 3-bounded property in a triangle-free distance-regular graph

AU - Pan, Yeh jong

AU - Weng, Chih-wen

PY - 2008/10

Y1 - 2008/10

N2 - Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 ≠ 0. We show that Γ is 3-bounded in the sense of the article [C. Weng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229].

AB - Let Γ denote a distance-regular graph with classical parameters (D, b, α, β) and D ≥ 3. Assume the intersection numbers a1 = 0 and a2 ≠ 0. We show that Γ is 3-bounded in the sense of the article [C. Weng, D-bounded distance-regular graphs, European Journal of Combinatorics 18 (1997) 211-229].

UR - http://www.scopus.com/inward/record.url?scp=45249094521&partnerID=8YFLogxK

U2 - 10.1016/j.ejc.2007.10.002

DO - 10.1016/j.ejc.2007.10.002

M3 - Article

AN - SCOPUS:45249094521

SN - 0195-6698

VL - 29

SP - 1634

EP - 1642

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 7

ER -

3-bounded property in a triangle-free distance-regular graph

Abstract

Access to Document

Other files and links

Fingerprint

Cite this