6 citations · 7 across the 7 of their papers we have counts for
7 papers
On distance matrices of distance-regular graphs
Hui Zhou, Rongquan Feng
In this paper, we give a characterization of distance matrices of distance-regular graphs to be invertible.
Hamilton cycles in generalized dihedral Cayley graphs and digraphs
Hui Zhou, Jiyong Chen, Binzhou Xia +3
We prove that every connected Cayley digraph on a generalized dihedral group of order at least has a directed Hamilton cycle. In particular, this confirms a conjecture of Holsz…
On -distance-transitive graphs
Hui Zhou, Cheryl Praeger, Michael Giudici +2
Distance-regular graphs have many beautiful combinatorial properties. Distance-transitive graphs have very strong symmetries, and they are distance-regular, i.e. distance-transitiv…
Hamiltonian decomposition of the Cayley graph on the dihedral group where is a prime
Hui Zhou, Liufeng Xu, Yang Cui +4
In this note, we give the Hamiltonian decomposition of the Cayley graph on the dihedral group where is a prime.
A graph theoretic characterization of the classical generalized hexagon on vertices
Hui Zhou
A tetravalent -arc-transitive graph of order is either the known -arc-transitive incidence graph of the classical generalized hexagon or a normal cover of a $…
On distance matrices of graphs
Hui Zhou, Qi Ding, Ruiling Jia
Distance well-defined graphs consist of connected undirected graphs, strongly connected directed graphs and strongly connected mixed graphs. Let be a distance well-defined grap…
Matching preclusion for -grid graphs
Qi Ding, Heping Zhang, Hui Zhou
A matching preclusion set of a graph is an edge set whose deletion results in a graph without perfect matching or almost perfect matching. The Cartesian product of paths is cal…