Rong-Xia Hao

collaborators

3 papers

math.CO2024

The saturation number for unions of four cliques

Ruo-Xuan Li, Rong-Xia Hao, Zhen He +1

A graph $G$ is $H$ -saturated if $H$ is not a subgraph of $G$ but $H$ is a subgraph of $G + e$ for any edge $e$ in $G$ . The saturation number $s a t (n, H)$ for a graph $H$ i…

math.CO2024

Saturation Numbers for Linear Forests $P_{7} + t P_{2}$

Yu Zhang, Rong-Xia Hao, Zhen He +1

Let $H$ be a fixed graph, a graph G is $H$ -saturated if it has no copy of $H$ in $G$ , but the addition of any edge in $E (G)$ to $G$ results in an $H$ -subgraph. The satura…

math.CO2024

Minimum saturated graphs for unions of cliques

Wen-Han Zhu, Rong-Xia Hao, Zhen He

Let $H$ be a fixed graph. A graph $G$ is called {\it $H$ -saturated} if $H$ is not a subgraph of $G$ but the addition of any missing edge to $G$ results in an $H$ -subgraph. The {\it…

The saturation number for unions of four cliques

Saturation Numbers for Linear Forests P7​+tP2​

Minimum saturated graphs for unions of cliques

Saturation Numbers for Linear Forests $P_{7} + t P_{2}$