Xinying Hua

collaborators

2 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 $\…