AbstractWe show that, if a bipartite distance-regular graph of valencykhas an eigenvalue of multiplicityk, then it becomes 2-homogeneous. Combined with a result on bipartite 2-homogeneous distance-regular graphs by K. Nomura, we have a classification of such graphs
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
AbstractIn this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue θ wit...
AbstractIn a distance-regular graph, the partition with respect to distance from a vertex supports a...
We classify triangle- and pentagon-free distance-regular graphs with diameter d >= 2, valency k, and...
AbstractWe classify triangle- and pentagon-free distance-regular graphs with diameter d⩾2, valency k...
Bipartite graphs are combinatorial objects bearing some interesting symmetries. Thus, their spectra—...
AbstractLet G be a distance-regular graph. If G has an eigenvalue θ of multiplicity m (≥ 2), then G ...
Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and interse...
AbstractLet G be a distance-regular graph. If G has an eigenvalue θ of multiplicity m (≥ 2), then G ...
Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and interse...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...
AbstractLet Γ be a triangle-free distance-regular graph with diameter d≥3, valency k≥3 and intersect...
In this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue theta with mu...
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
AbstractIn this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue θ wit...
AbstractIn a distance-regular graph, the partition with respect to distance from a vertex supports a...
We classify triangle- and pentagon-free distance-regular graphs with diameter d >= 2, valency k, and...
AbstractWe classify triangle- and pentagon-free distance-regular graphs with diameter d⩾2, valency k...
Bipartite graphs are combinatorial objects bearing some interesting symmetries. Thus, their spectra—...
AbstractLet G be a distance-regular graph. If G has an eigenvalue θ of multiplicity m (≥ 2), then G ...
Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and interse...
AbstractLet G be a distance-regular graph. If G has an eigenvalue θ of multiplicity m (≥ 2), then G ...
Let Gamma be a triangle-free distance-regular graph with diameter d >= 3, valency k >= 3 and interse...
Godsil showed that if Gamma is a distance-regular graph with diameter D >= 3 and valency k >= 3, and...
AbstractLet Γ be a triangle-free distance-regular graph with diameter d≥3, valency k≥3 and intersect...
In this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue theta with mu...
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the...
AbstractIn this paper, triangle-free distance-regular graphs with diameter 3 and an eigenvalue θ wit...
AbstractIn a distance-regular graph, the partition with respect to distance from a vertex supports a...
DOI
Add to ORKG