In this paper we study a distance-regular graph Γ of diameter d ≥ 3 which satisfies the following two conditions: (a) For any integer i with 1 ≤ i ≤ d - 1 and for any pair of vertices at distance i in Γ there exists a strongly closed subgraph of d...
Let Gamma be a Delsarte set graph with an intersection number c(2) (i.e., a distance-regular graph with a set C of Delsarte cliques such that each edge lies in a positive constant number n(C) of Delsarte cliques in C). We showed in Bang et al. (J ...
EUROPEAN JOURNAL OF COMBINATORICS 30(4) 893-907 2009年5月
In this paper we study a distance-regular graph Gamma of diameter d >= 4 such that for any given pair of vertices at distance d - 1 there exists a strongly closed subgraph of diameter d - 1 containing them. We prove several inequalities for int...
Let Gamma be a distance-regular graph of diameter d >= 3 with c(2) > 1. Let m be an integer with 1 <= m <= d - 1. We consider the following conditions:
(SC)(m) : For any pair of vertices at distance m there exists a strongly closed sub...
Let Gamma be a distance-regular graph of diameter d >= 3 with c(2) > 1. Let m be an integer with 1 <= m <= d - 1. We consider the following conditions:
(SC)(m) : For any pair of vertices at distance m there exists a strongly closed sub...
総合教育系