Qingjie Ye

activity

20202026

most citedA bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem

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

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Tight bounds for generalized power domination in regular graphs

Hangdi Chen, Changhong Lu, Qingjie Ye

Dorbec et al. [SIAM J. Discrete Math., 27 (2013)] conjectured that, for all integers $k \geq 1$ and $r \geq 3$ , every connected $r$ -regular graph $G$ of order $n$ , other than $K_{r, r}$ …

math.CO2021★ 3 cited

The Alon-Tarsi number of Halin graphs

Zhiguo Li, Qing Ye, Zeling Shao

The Alon-Tarsi number of a graph $G$ is the smallest $k$ for which there is an orientation $D$ of $G$ with max outdegree $k - 1$ such that the number of Eulerian subgraphs of $G$ wit…

math.CO2020★ 6 cited

A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem

Changhong Lu, Qingjie Ye

In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in h…