AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ is said to be weakly distance-regular if, for all vertices x and y with (∂(x,y),∂(y,x))=h̃, |{z∈VΓ|(∂(x,z),∂(z,x))=ĩand(∂(z,y),∂(y,z))=j̃}| depends only on h̃,ĩ and j̃. We give some constructions of weakly distance-regular digraphs and discuss the connections to association schemes. Finally, we determine all commutative weakly distance-regular digraphs of valency 2
AbstractWe introduce some constructions of weakly distance-regular digraphs of girth 2, and prove th...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
AbstractWe introduce some constructions of weakly distance-regular digraphs of girth 2, and prove th...
We prove that Moore digraphs, and some other classes of extremal digraphs, are weakly distance-regul...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
AbstractA family of commutative weakly distance-regular digraphs of girth 2 was classified in [K. Wa...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
We adopt the definition of a distance-transitive digraph given by Lam. If such a digraph has girth g...
AbstractWe consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
AbstractWe introduce some constructions of weakly distance-regular digraphs of girth 2, and prove th...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
AbstractWe introduce some constructions of weakly distance-regular digraphs of girth 2, and prove th...
We prove that Moore digraphs, and some other classes of extremal digraphs, are weakly distance-regul...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
AbstractA family of commutative weakly distance-regular digraphs of girth 2 was classified in [K. Wa...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
We adopt the definition of a distance-transitive digraph given by Lam. If such a digraph has girth g...
AbstractWe consider a directed version of Deza graphs. A digraph is said to be a Deza digraph if it ...
AbstractIn this paper, we study the distance-regular graphs Γ that have a pair of distinct vertices,...
This is a survey of distance-regular graphs. We present an in-troduction to distance-regular graphs ...
AbstractWe introduce some constructions of weakly distance-regular digraphs of girth 2, and prove th...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractThe concept of local pseudo-distance-regularity, introduced in this paper, can be thought of...
DOI
Add to ORKG