Add to ORKGWe prove the following bound for a kregular graph on n vertices with nontrivial eigenvalues from the interval r s nk rs k rk s Equality holds if and only if the graph is strongly regular with eigenvalues in fk s rg Nonbipartite distanceregular graphs with diameter d and eigenvalues
AbstractLet Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense ...
An undirected graph is called k-regular if exactly k edges meet at each vertex. The eigenvalues of t...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...
Abstract An upper bound is given on the minimum distance between i subsets of the same size of a reg...
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (r...
An upper bound is given on the minimum distance between i subsets of same size of a regular graph in...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
Let Γ denote a distance-regular graph with diameter d ≥ 3, and assume Γ is tight (in the sense of Ju...
AbstractLet Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and ...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
In this paper, we classify distance-regular graphs such that all of its second largest local eigenva...
AbstractA non-complete geometric distance-regular graph is the point graph of a partial linear space...
AbstractIn this paper, we classify distance regular graphs such that all of its second largest local...
The distance matrix of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distan...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense ...
An undirected graph is called k-regular if exactly k edges meet at each vertex. The eigenvalues of t...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...
Abstract An upper bound is given on the minimum distance between i subsets of the same size of a reg...
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) theta(1) (r...
An upper bound is given on the minimum distance between i subsets of same size of a regular graph in...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
This thesis is an expository work taken from Sections 1-8 of the paper entitled Tight Distance-Regul...
Let Γ denote a distance-regular graph with diameter d ≥ 3, and assume Γ is tight (in the sense of Ju...
AbstractLet Γ denote a distance-regular graph with a strongly closed regular subgraph Y. Hosoya and ...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3. Let E, F denote nontrivial primitiv...
In this paper, we classify distance-regular graphs such that all of its second largest local eigenva...
AbstractA non-complete geometric distance-regular graph is the point graph of a partial linear space...
AbstractIn this paper, we classify distance regular graphs such that all of its second largest local...
The distance matrix of a simple connected graph $G$ is $D(G)=(d_{ij})$, where $d_{ij}$ is the distan...
AbstractLet Γ denote a distance-regular graph with diameter d⩾3, and assume Γ is tight in the sense ...
An undirected graph is called k-regular if exactly k edges meet at each vertex. The eigenvalues of t...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...