May 23, 2009 · Applying this result we prove that a distance-regular graph with classical parameters (d, b, α, β) such that c 2 > 1 and a 1 = 0 < a 2 satisfies ...
Missing: c2 > a1 = a2.
Applying this result we prove that a distance-regular graph with classical parameters (d, b, α, β) such that c 2 > 1 and a 1 = 0 < a 2 satisfies the condition ( ...
Oct 22, 2024 · 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 ...
Mar 25, 2012 · A distance-regular graph (DRG) is, in essence, a graph Γ of diameter d for which there are integers ci,ai,bi,(0≤i≤d) such that for all vertices ...
Missing: c2 > a1 = a2.
In this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y ...
Missing: a2. | Show results with:a2.
Aug 6, 2010 · Abstract. In this paper, we study distance-regular graphs Γ that have a pair of distinct vertices, say x and y, such that the number of ...
Strongly Closed Subgraphs in a Distance-Regular Graph with c2 > 1 ...
www.semanticscholar.org › paper
Distance-Regular Graph with c2 > 1 and a1 = 0 < a2 · Akira Hiraki · 2009 ; Distance-regular graphs · Hajime Tanaka · 2014 ; The nucleus of a $Q$-polynomial distance- ...
For the assumptions a2 > a1 and c2 = 1, H. Suzuki proves the case d = 2 in. Theorem 3 [8]; in particular Γ contains a regular weak-geodetically closed subgraph.
In this paper, we study distance-regular graphs Γ \Gamma that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x ...
Missing: a2. | Show results with:a2.
Distance-Regular Graph with c2 > 1 and a1 = 0 < a2 · Akira Hiraki. Mathematics. Graphs Comb. 2009. TLDR. It is proved that a distance-regular graph with ...