Corpus ID: 236772916

Weakly distance-regular digraphs of one type of arcs

@inproceedings{Fan2021WeaklyDD,
  title={Weakly distance-regular digraphs of one type of arcs},
  author={Yushuang Fan and Zhiqi Wang and Yuefeng Yang},
  year={2021}
}
  • Yushuang Fan, Zhiqi Wang, Yuefeng Yang
  • Published 2021
  • Mathematics
In this paper, we classify all commutative weakly distance-regular digraphs of girth g and one type of arcs under the assumption that p (2,g−2) (1,g−1),(1,g−1) ≥ k1,g−1 − 2. In consequence, we recover [13, Theorem 1.1] as a special case of 

References

SHOWING 1-10 OF 25 REFERENCES
Weakly Distance-Regular Digraphs of Valency Three, I
TLDR
This project to classify weakly distance-regular digraphs of valency 3 with girth more than 2 and two types of arcs is continued. Expand
Weakly Distance-Regular Digraphs of Valency Three, I
Suzuki (2004)  classified thin weakly distance-regular digraphs and proposed the project to classify weakly distance-regular digraphs of valency 3. The case of girth 2 was classified by the thirdExpand
Quasi-thin weakly distance-regular digraphs
A weakly distance-regular digraph is quasi-thin if the maximum value of its intersection numbers is 2. In this paper, we focus on commutative quasi-thin weakly distance-regular digraphs, and classifyExpand
Commutative weakly distance-regular digraphs of girth 2
  • K. Wang
  • Computer Science, Mathematics
  • Eur. J. Comb.
  • 2004
TLDR
It is proved that a certain quotientDigraph of a commutative weakly distance-transitive digraph of girth 2 is a distance-Transitive graph. Expand
Thin weakly distance-regular digraphs
  • Hiroshi Suzuki
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 2004
TLDR
The classification of thin weakly distance-regular digraphs amounts to the determination of all finite groups G possessing a distinguished generating subset S that satisfies the following property: x = y. Expand
Weakly Distance-regular Digraphs
TLDR
All commutative weakly distance-regular digraphs of valency 2 are determined and the connections to association schemes are discussed. Expand
Theory of Association Schemes
Basic Facts.- Closed Subsets.- Generating Subsets.- Quotient Schemes.- Morphisms.- Faithful Maps.- Products.- From Thin Schemes to Modules.- Scheme Rings.- Dihedral Closed Subsets.- Coxeter Sets.-Expand
Generalized table algebras
A table algebra was defined in [1] in order to consider in a uniform way the common properties of conjugacy classes and irreducible characters. Non-commutative table algebras were introduced in [5].Expand
Distance-regular graphs, Electron
  • J. Combin. (2016)
  • 2016
...
1
2
3
...