Xinying Hua

most citedZero forcing number versus general position number in tree-like graphs

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

collaborators

4 papers

math.CO2026

Saturation numbers of some joins of graphs

Xinying Hua, Yuejian Peng

Let $H$ be a graph. A graph $G$ is $H$ -saturated if $G$ is $H$ -free, but adding any edge between two non-adjacent vertices of $G$ yields an $H$ -copy as a subgraph. The saturation n…

math.CO2026

Saturation numbers for joins of graphs and characterization of extremal graphs

Xinying Hua, Yuejian Peng

A graph $G$ is $H$ -saturated if $G$ contains no $H$ -copy as a subgraph, but adding any edge between two non-adjacent vertices in $G$ creates a copy of $H$ . The saturation number $\…

math.CO2021★ 1 cited

Zero forcing number versus general position number in tree-like graphs

Hongbo Hua, Xinying Hua, Sandi Klavžar

Let $Z (G)$ and $gp (G)$ be the zero forcing number and the general position number of a graph $G$ , respectively. Known results imply that $gp (T) \geq Z (T) + 1$ …

math.CO2021

Relating the total domination number and the annihilation number for quasi-trees and some composite graphs

Hongbo Hua, Xinying Hua, Sandi Klavžar +1

The total domination number $γ_{t} (G)$ of a graph $G$ is the cardinality of a smallest set $D \subseteq V (G)$ such that each vertex of $G$ has a neighbor in $D$ . The annihilation nu…