Yanping Xie

activity

20242026

collaborators

5 papers

math.CO2026

Cop numbers for subclasses of partial cubes

Zhaoman Huang, Yan-Ting Xie, Shou-Jun Xu

The game of Cops and Robbers is a classical pursuit--evasion game on graphs. For a graph $G$ , the cop number $c (G)$ is the minimum number of cops needed to guarantee the capture of…

math.CO2026

Resolving the Klavžar-Kovše conjecture on opposite semicube isomorphisms in partial cubes and its extension

Zhaoman Huang, Yan-Ting Xie, Shou-Jun Xu

Partial cubes are a fundamental class of graphs that admit isometric embeddings into hypercubes. Klavžar and Kovše [Ars Combin. 93 (2009), 77--86] observed that the opposite semicu…

math.CO2026

Resolving problems on polynomial characterizations of daisy cubes and extensions

Xuan Zheng, Yan-Ting Xie, Shou-Jun Xu

Let $X \subseteq {0, 1}^{n}$ be a set of binary strings of length $n$ . The daisy cube $Q_{n} (X)$ is the subgraph of the hypercube $Q_{n}$ induced by the union of the intervals $I (0^{n}, x)$ …

math.CO2025

Characterizing simplex graphs

Yan-Ting Xie, Shou-Jun Xu

The simplex graph $S (G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of…

math.CO2024

Ultra log-concavity and real-rootedness of dependence polynomials

Yan-Ting Xie, Shou-Jun Xu

For some positive integer $m$ , a real polynomial $P (x) = k = 0 \sum m a_{k} x^{k}$ with $a_{k} ⩾ 0$ is called log-concave (resp. ultra log-concave) if $a_k^2\geqslant a_{k-1}a_…