Rongxia Hao

activity

20132026

most citedThe Component Connectivity of Alternating Group Graphs and Split-Stars

24 citations · 43 across the 26 of their papers we have counts for

collaborators

Showing 2018Show all

8 papers · 1 filter

cs.DM2018★ 24 cited

The Component Connectivity of Alternating Group Graphs and Split-Stars

Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang

For an integer $ℓ ⩾ 2$ , the $ℓ$ -component connectivity of a graph $G$ , denoted by $κ_{ℓ} (G)$ , is the minimum number of vertices whose removal from $G$ results in a…

math.CO2018★ 1 cited

The $g$ -good neighbour diagnosability of hierarchical cubic networks

Shu-Li Zhao, Rong-Xia Hao

Let $G = (V, E)$ be a connected graph, a subset $S \subseteq V (G)$ is called an $R^{g}$ -vertex-cut of $G$ if $G - F$ is disconnected and any vertex in $G - F$ has at least $g$ neighbours…

math.CO2018★ 2 cited

Antimagic orientations of disconnected even regular graphs

Chen Song, Rong-Xia Hao

A $l ab e l in g$ of a digraph $D$ with $m$ arcs is a bijection from the set of arcs of $D$ to ${1, 2, \dots, m}$ . A labeling of $D$ is $an t ima g i c$ if no two vertices in $D$ have the sa…

math.CO2018

Bounds on the edge-Wiener index of cacti with $n$ vertices and $t$ cycles

Siyan Liu, Rong-Xia Hao

The edge-Wiener index $W_{e} (G)$ of a connected graph $G$ is the sum of distances between all pairs of edges of $G$ . A connected graph $G$ is said to be a cactus if each of its block…

math.CO2018

The generalized connectivity of some regular graphs

Shu-Li Zhao, Rong-Xia Hao

The generalized $k$ -connectivity $κ_{k} (G)$ of a graph $G$ is a parameter that can measure the reliability of a network $G$ to connect any $k$ vertices in $G$ , which is proved to b…

math.CO2018

The generalized connectivity of $(n, k)$ -bubble-sort graphs

Shu-Li Zhao, Rong-Xia Hao, Lidong Wu

Let $S \subseteq V (G)$ and $κ_{G} (S)$ denote the maximum number $r$ of edge-disjoint trees $T_{1}, T_{2}, \dots, T_{r}$ in $G$ such that $V (T_{i}) ⋂ V (T_{j}) = S$ for any $i, j \in \{1,…

math.CO2018

On extremal cacti with respect to the edge revised Szeged index

Shengjie He, Rong-Xia Hao, Deming Li

Let $G$ be a connected graph. The edge revised 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.CO2018★ 1 cited

Two kinds of generalized connectivity of dual cubes

Shu-Li Zhao, Rong-Xia Hao, Eddie Cheng

Let $S \subseteq V (G)$ and $κ_{G} (S)$ denote the maximum number $k$ of edge-disjoint trees $T_{1}, T_{2}, \dots, T_{k}$ in $G$ such that $V (T_{i}) ⋂ V (T_{j}) = S$ for any $i, j…

The Component Connectivity of Alternating Group Graphs and Split-Stars

The g-good neighbour diagnosability of hierarchical cubic networks

Antimagic orientations of disconnected even regular graphs

Bounds on the edge-Wiener index of cacti with n vertices and t cycles

The generalized connectivity of some regular graphs

The generalized connectivity of (n,k)-bubble-sort graphs

On extremal cacti with respect to the edge revised Szeged index

Two kinds of generalized connectivity of dual cubes

The $g$ -good neighbour diagnosability of hierarchical cubic networks

Bounds on the edge-Wiener index of cacti with $n$ vertices and $t$ cycles

The generalized connectivity of $(n, k)$ -bubble-sort graphs