AbstractWe introduce some constructions of weakly distance-regular digraphs of girth 2, and prove that a certain quotient digraph of a commutative weakly distance-transitive digraph of girth 2 is a distance-transitive graph. As an application of the result, we obtain some examples of weakly distance-regular digraphs which are not weakly distance-transitive. Moreover, a class of commutative weakly distance-regular (respectively weakly distance-transitive) digraphs of girth 2 is characterized. Finally, all commutative weakly distance-regular digraphs of valency 3 and girth 2 are classified
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ...
We adopt the definition of a distance-transitive digraph given by Lam. If such a digraph has girth g...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
We determine all distance-transitive directed graphs of odd girth. Related results, under various gr...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ...
We prove that Moore digraphs, and some other classes of extremal digraphs, are weakly distance-regul...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
AbstractBipartite distance-regular graphs of valency three are classified. There are eight such grap...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ...
We adopt the definition of a distance-transitive digraph given by Lam. If such a digraph has girth g...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
115 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1982.A distance-transitive graph (...
We determine all distance-transitive directed graphs of odd girth. Related results, under various gr...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...
AbstractWe consider the following generalization of distance-regular digraphs. A connected digraph Γ...
We prove that Moore digraphs, and some other classes of extremal digraphs, are weakly distance-regul...
AbstractWe study the structure of a distance-regular graph Γ with girth 3 or 4. First, we find some ...
AbstractWe introduce the concept of weakly distance-regular digraph and study some of its basic prop...
AbstractBipartite distance-regular graphs of valency three are classified. There are eight such grap...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
In this chapter we investigate the classification of distance-transitive graphs: these are graphs wh...
AbstractA digraph is said to be distance-transitive if for all vertices u, v, x, y such that d(u, v)...