Wen-Han Zhu

collaborators

4 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…

math.CO2024

Packing internally disjoint Steiner paths of data center networks

Wen-Han Zhu, Rong-Xia Hao, Jou-Ming Chang +1

Let $S \subseteq V (G)$ and $π_{G} (S)$ denote the maximum number $t$ of edge-disjoint paths $P_{1}, P_{2}, \dots, P_{t}$ in a graph $G$ such that $V (P_{i}) \cap V (P_{j}) = S$ for any $i,j…

The saturation number for unions of four cliques

Saturation Numbers for Linear Forests P7​+tP2​

Minimum saturated graphs for unions of cliques

Packing internally disjoint Steiner paths of data center networks

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