Add to ORKGThis thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (s, c, a, k)-Graphs . In this paper, the following are presented: 1. A diameter bound theorem for a class of distance-regular graphs which includes all those with even girth. 2. A new class of graphs, called (s, c, a, k)-graphs, which are conjectured to contain enough of the local structure of finite distance-regular graphs for them to be all finite. 3. A (s, c, a, k)-graph is finite and a bound on the diameter is given if a - c
Considering a connected graph $G$ with diameter $D$, we say that it is \emph{$k$-walk-regular}, for ...
Let be a distance regular graph with diameter d and valency k. For nonnegative integers i and j, wit...
Abstract. A point set X in the plane is called a k-distance set if there are exactly k different dis...
This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
The thesis is an exposition of the article of A. Hiraki, H. Suzuki and M. Wajima entitled On Distanc...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
AbstractIt is shown that any bipartite distance-regular graph with finite valency k and at least one...
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
Considering a connected graph $G$ with diameter $D$, we say that it is \emph{$k$-walk-regular}, for...
Considering a connected graph $G$ with diameter $D$, we say that it is \emph{$k$-walk-regular}, for ...
Let be a distance regular graph with diameter d and valency k. For nonnegative integers i and j, wit...
Abstract. A point set X in the plane is called a k-distance set if there are exactly k different dis...
This thesis is an exposition of the paper of Paul Terwilliger entitled Distance-Regular Graphs and (...
AbstractA diameter-bound theorem for a class of distance-regular graphs which includes all those wit...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
The thesis is an exposition of the article of A. Hiraki, H. Suzuki and M. Wajima entitled On Distanc...
AbstractIn this paper we study the sequence (ci)0≤i≤d for a distance-regular graph. In particular we...
AbstractIt is shown that any bipartite distance-regular graph with finite valency k and at least one...
Abstract. We characterize the distance-regular graphs with diameter three by giving an expression fo...
Let G be a bipartite distance-regular graph with bipartition V(G) = X ∪ Y. Let V(G′) = X and, for x ...
We characterize the distance-regular graphs with diameter three by giving an expression for the numb...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
Considering a connected graph $G$ with diameter $D$, we say that it is \emph{$k$-walk-regular}, for...
Considering a connected graph $G$ with diameter $D$, we say that it is \emph{$k$-walk-regular}, for ...
Let be a distance regular graph with diameter d and valency k. For nonnegative integers i and j, wit...
Abstract. A point set X in the plane is called a k-distance set if there are exactly k different dis...