3 papers
math.CO2026
On walk domination: Between different types of walks and -path
Hangdi Chen, Yuhan Ma, Qingjie Ye
Given two non-adjacent vertices \( u \) and \( v \), we say a -walk \( W \) dominates a -walk \( W' \) if every internal vertex of \( W' \) is adjacent to some internal ver…
math.CO2026
On the minimum doubly resolving set problem in line graphs
Qingjie Ye
Given a connected graph with at least three vertices, let denote the distance between vertices . A subset is called a doubly resolving se…
math.OC2025
Supermodular Maximization with Cardinality Constraints
Xujin Chen, Xiaodong Hu, Changjun Wang +1
Let be a finite set of elements, be a nonnegative monotone supermodular function, and be a positive integer no greater than . This…