Rong‐Xia Hao

collaborators

4 papers

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…

math.CO2023

The extremal unicyclic graphs of the revised edge Szeged index with given diameter

Shengjie He, Qiaozhi Geng, Rong-Xia Hao

Let $G$ be a connected graph. The revised edge Szeged index of $G$ is defined as $Sz^{\ast}_{e}(G)=\sum\limits_{e=uv\in E(G)}(m_{u}(e|G)+\frac{m_{0}(e|G)}{2})(m_{v}(e|G)+\frac{m_{0…

math.CO2023

No mixed graph with the nullity $η (G) = ∣ V (G) ∣ - 2 m (G) + 2 c (G) - 1$

Shengjie He, Rong-Xia Hao, Hong-Jian Lai +1

A mixed graph $G$ is obtained from a simple undirected graph $G$ , the underlying graph of $G$ , by orienting some edges of $G$ . Let $c (G) = ∣ E (G) ∣ - ∣ V (G) ∣ + ω (G)$ …

Minimum saturated graphs for unions of cliques

Packing internally disjoint Steiner paths of data center networks

The extremal unicyclic graphs of the revised edge Szeged index with given diameter

No mixed graph with the nullity η(G)=∣V(G)∣−2m(G)+2c(G)−1

No mixed graph with the nullity $η (G) = ∣ V (G) ∣ - 2 m (G) + 2 c (G) - 1$