Nonexistence of a Class of Distance-Regular Graphs

Electronic Journal Of Combinatorics

Yu-pei Huang¹ 

关键词: Distance-regular graph;    classical parameters;    parallelogram;    strongly closed subgraph;    D-bounded.;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Let $\Gamma$ denote a distance-regular graph with diameter $D \geq 3$ and intersection numbers $a_1=0, a_2 \neq 0$, and $c_2=1$. We show a connection between the $d$-bounded property and the nonexistence of parallelograms of any length up to $d+1$. Assume

【 授权许可】

Others