1. Introduction. A t -claw is a complete bipartite graph K 1 , t with parts of size 1 and t . We say that a graph is t -claw-free (or without t -claws), ...

Jun 19, 2017 · Abstract:We determine the distance-regular graphs with diameter at least 3 and c_2\geq 2 but without induced K_{1,4}-subgraphs.

Jan 1, 2013 · In this paper we determine the non-complete distance-regular graphs satisfying 3 , 8 3 ( a 1 + 1 ) < k < 4 a 1 + 10 - 6 c 2 .

In this paper, we determine the non-complete distance-regular graphs ... Geometric distance-regular graphs without 4-claws. Bang, Sejeong. Abstract. A ...

{a} ∪ [a]. A graph {u; y1, y2, …, ym} is called an m claw if the degree of u is m and the degrees of the vertices y1, y2, …, ym are equal to 1.

We determine the distance-regular graphs with diameter at least $3$ and $c_2\geq 2$ but without induced $K_{1,4}$-subgraphs.

We determine the distance-regular graphs with diameter at least 3 and c_2≥ 2 but without induced K_1,4-subgraphs.

In the general case no analogous classification for the geometric distance-regular graphs with smallest eigenvalue −m appears to be known with m ≥ 4. We would ...

Jan 3, 2011 · Geometric distance-regular graphs without 4-claws. S. Bang. Department of Mathematical Sciences, BK21-Mathematical Sciences Division. Seoul ...

On distance-regular graphs without 4-claws · Article PDF · References · Author information · Additional information · Rights and permissions · About this article ...