Qing-Jie Ye

collaborators

3 papers

math.CO2026

On the minimum doubly resolving set problem in line graphs

Qingjie Ye

Given a connected graph $G$ with at least three vertices, let $d_{G} (u, v)$ denote the distance between vertices $u, v \in V (G)$ . A subset $S \subseteq V$ is called a doubly resolving se…

math.OC2025

Supermodular Maximization with Cardinality Constraints

Xujin Chen, Xiaodong Hu, Changjun Wang +1

Let $V$ be a finite set of $n$ elements, $f : 2^{V} \to R_{+}$ be a nonnegative monotone supermodular function, and $k$ be a positive integer no greater than $n$ . This…

math.CO2025

On walk domination: Between different types of walks and $m_{3}$ -path

Hangdi Chen, Yuhan Ma, Qingjie Ye

Given two non-adjacent vertices $ u $ and $ v $, we say a $uv$ -walk $ W $ dominates a $uv$ -walk $ W' $ if every internal vertex of $ W' $ is adjacent to some internal ver…

On the minimum doubly resolving set problem in line graphs

Supermodular Maximization with Cardinality Constraints

On walk domination: Between different types of walks and m3​-path

On walk domination: Between different types of walks and $m_{3}$ -path