6 citations · 12 across the 4 of their papers we have counts for
4 papers
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 and , every connected -regular graph of order , other than …
The Alon-Tarsi number of Halin graphs
Zhiguo Li, Qing Ye, Zeling Shao
The Alon-Tarsi number of a graph is the smallest for which there is an orientation of with max outdegree such that the number of Eulerian subgraphs of wit…
Second-Order Conic and Polyhedral Approximations of the Exponential Cone: Application to Mixed-Integer Exponential Conic Programs
Qing Ye, Weijun Xie
Exponents and logarithms are fundamental components in many important applications such as logistic regression, maximum likelihood, relative entropy, and so on. Since the exponenti…
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…