AbstractLetΛbe a distance-regular graph of diameterdand valencyk>2. Ifbt=1 and 2t⩽d, thenΛis an antipodal double-cover. Consequently, iff>2 is the multiplicity of an eigenvalue of the adjacency matrix ofΛand ifΛis not an antipodal double-cover thend⩽2f−3. This result is an improvement of Godsil's bound
AbstractAn r-fold antipodal cover of a distance-regular graph of valency k always satisfies r⩽k (Gar...
AMS Subject Classication: 05Exx Abstract. In 1988, Godsil [12] showed that for a distance-regular gr...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
This thesis is an exposition of the paper entitled On Distance Regular Graphs with b2 = 1 and Antipo...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...
AbstractWe show that a distance-regular graph of valencyk>2 is antipodal, ifb2=1. This answers Probl...
AbstractLet G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if...
Let $\Gamma$ be a regular (connected) graph with $n$ vertices and $d+1$ distinct eigenvalues. As a m...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
AbstractLet Γ be a distance-regular graph with diameter d. We show that if ki = kj with i < j and i ...
Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. ...
Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and interse...
AbstractLet Γ be a triangle-free distance-regular graph with diameter d≥3, valency k≥3 and intersect...
AbstractOur main result in this paper is the followingTheorem: Let Λ be a distance-regular graph wit...
In this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue theta with mu...
AbstractAn r-fold antipodal cover of a distance-regular graph of valency k always satisfies r⩽k (Gar...
AMS Subject Classication: 05Exx Abstract. In 1988, Godsil [12] showed that for a distance-regular gr...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
This thesis is an exposition of the paper entitled On Distance Regular Graphs with b2 = 1 and Antipo...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...
AbstractWe show that a distance-regular graph of valencyk>2 is antipodal, ifb2=1. This answers Probl...
AbstractLet G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if...
Let $\Gamma$ be a regular (connected) graph with $n$ vertices and $d+1$ distinct eigenvalues. As a m...
Let the Kneser graph K of a distance-regular graph G be the graph on the same vertex set as G, where...
AbstractLet Γ be a distance-regular graph with diameter d. We show that if ki = kj with i < j and i ...
Let G be a distance-regular graph with diameter d and Kneser graph K=Gd, the distance-d graph of G. ...
Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and interse...
AbstractLet Γ be a triangle-free distance-regular graph with diameter d≥3, valency k≥3 and intersect...
AbstractOur main result in this paper is the followingTheorem: Let Λ be a distance-regular graph wit...
In this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue theta with mu...
AbstractAn r-fold antipodal cover of a distance-regular graph of valency k always satisfies r⩽k (Gar...
AMS Subject Classication: 05Exx Abstract. In 1988, Godsil [12] showed that for a distance-regular gr...
The distance matrix of a graph G is the matrix containing the pairwise distances between vertices. T...
DOI
Add to ORKG