Q. Ding

activity

20162018

n

-grid graphs

6 citations · 6 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2018

Hamiltonian decomposition of the Cayley graph on the dihedral group $D_{2 p}$ where $p$ 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 $D_{2 p}$ where $p$ is a prime.

math.CO2017

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 $G$ be a distance well-defined grap…

math.CO2016★ 6 cited

Matching preclusion for $n$ -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 $n$ paths is cal…

Hamiltonian decomposition of the Cayley graph on the dihedral group D2p​ where p is a prime

On distance matrices of graphs

Matching preclusion for n-grid graphs

Hamiltonian decomposition of the Cayley graph on the dihedral group $D_{2 p}$ where $p$ is a prime

Matching preclusion for $n$ -grid graphs