7 papers · 1 filter
Weakly distance-regular digraphs of diameter 2
Xiangli Wang, Yuefeng Yang
Weakly distance-regular digraphs is a directed version of distance-regular graphs. In this paper, we characterize all weakly distance-regular digraphs of diameter 2.
Semicomplete multipartite weakly distance-regular digraphs
Shuang Li, Yuefeng Yang, Kaishun Wang
A digraph is semicomplete multipartite if its underlying graph is a complete multipartite graph. As a special case of semicomplete multipartite digraphs, Jørgensen et al. \cite{JG1…
Weakly distance-regular digraphs of one type of arcs
Yushuang Fan, Zhiqi Wang, Yuefeng Yang
In this paper, we classify all commutative weakly distance-regular digraphs of girth and one type of arcs under the assumption that $p_{(1,g-1),(1,g-1)}^{(2,g-2)}\geq k_{1,g-1}…
On weak metric dimension of digraphs
Min Feng, Kaishun Wang, Yuefeng Yang
Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph . We first establish lower and upper bounds for the number of arcs…
Perfect codes in Cayley sum graphs
Xuanlong Ma, Kaishun Wang, Yuefeng Yang
A subset of the vertex set of a graph is called a perfect code of if every vertex of is at distance no more than one to exactly one vertex in . Let be a fini…
Thick weakly distance-regular digraphs
Yuefeng Yang, Kaishun Wang
A weakly distance-regular digraph is thick if its attached scheme is regular. In this paper, we show that each commutative thick weakly distance-regular digraph has a thick weakly…