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

27 papers

math.CO2026

Partial-Twuality Polynomials of Paired Matrices

Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu

Gross, Mansour, and Tucker~[European Journal of Combinatorics, 95 (2021): 103329] introduced the \emph{partial-twuality polynomials} of ribbon graphs. Recently, Deng, Jin, and Yan…

math.CO2026

Partial Petrial Polynomials of Bouquets

Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu +1

Gross, Mansour, and Tucker [European J. Combin., 95 (2021): 103329] introduced the \emph{partial Petrial polynomial} of a ribbon graph $G$ , denoted by $^{\partial}{\varepsilon^{\ti…

math.CO2026

Partial Petrial Polynomials of Ribbon Graphs

Xiaoxiang Yu, Rong-Xia Hao, Jianbing Liu +1

Gross, Mansour, and Tucker [European J. Combin., 95 (2021): 103329] introduced the \emph{partial Petrial polynomial} of a ribbon graph $G$ , denoted by $^{\partial}{\varepsilon^{\ti…

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)$ …

math.CO2019

Paired 3-disjoint path covers of balanced hypercubes

Mei-Rong Guo, Rong-Xia Hao, Mei-Mei Gu

The balanced hypercube $B H_{n}$ , proposed by Wu and Huang, is a variation of the hypercube. The paired 1-disjoint path cover of $B H_{n}$ is the Hamiltonian laceability, which was o…

math.CO2019★ 1 cited

Strong Menger connectedness of augmented $k$ -ary $n$ -cubes

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

A connected graph $G$ is called strongly Menger (edge) connected if for any two distinct vertices $x, y$ of $G$ , there are $min {deg_{G} (x), deg_{G} (y)}$ vertex(edge)-dis…

math.CO2019★ 1 cited

Bounds for the rank of a complex unit gain graph in terms of the independence number

Shengjie He, Rong-Xia Hao, Aimei Yu

A complex unit gain graph (or $T$ -gain graph) is a triple $Φ = (G, T, φ)$ ( $(G, φ)$ for short) consisting of a graph $G$ as the underlying graph of $(G, φ)$ , $\math…

math.CO2019★ 1 cited

On the inertia index of a mixed graph with the matching number

Shengjie He, Rong-Xia Hao, Aimei Yu

A mixed graph $G$ is obtained by orienting some edges of $G$ , where $G$ is the underlying graph of $G$ . The positive inertia index, denoted by $p^{+} (G)$ , a…

math.CO2019

The rank of a complex unit gain graph in terms of the matching number

Shengjie He, Rong-Xia Hao, Fengming Dong

A complex unit gain graph (or $T$ -gain graph) is a triple $Φ = (G, T, φ)$ (or $(G, φ)$ for short) consisting of a simple graph $G$ , as the underlying graph of $(G…

math.CO2019

The relation between the independence number and rank of a signed graph

Shengjie He, Rong-Xia Hao

A signed graph $(G, σ)$ is a graph with a sign attached to each of its edges, where $G$ is the underlying graph of $(G, σ)$ . Let $c (G)$ , $α (G)$ and $r (G, σ)$ be the cyclomatic numb…

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…

math.CO2017★ 3 cited

On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index

Shengjie He, Rong-Xia Hao, Aimei Yu

The edge Szeged index and edge-vertex Szeged index of a graph are defined as $S z_{e} (G) = uv \in E (G) \sum m_{u} (uv ∣ G) m_{v} (uv ∣ G)$ and $Sz_{ev}(G)=\frac{1}{2} \sum\limits_{uv…

math.CO2017

Berge-Fulkerson coloring for infinite families of snarks

Ting Zheng, Rong-Xia Hao

It is conjectured by Berge and Fulkerson that every bridgeless cubic graph has six perfect matchings such that each edge is contained in exactly two of them. H $a ¨$ gglund cons…

cs.DC2017

Fault diagnosability of data center networks

Mei-Mei Gu, Rong-Xia Hao, Shuming Zhou

The data center networks $D_{n, k}$ , proposed in 2008, has many desirable features such as high network capacity. A kind of generalization of diagnosability for network $G$ is $g$ -g…

math.CO2017

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs

Mei-Mei Gu, Rong-Xia Hao, Jun-Ming Xu +1

Extra connectivity and the pessimistic diagnosis are two crucial subjects for a multiprocessor system's ability to tolerate and diagnose faulty processor. The pessimistic diagnosis…

math.CO2016★ 1 cited

Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges

Mei-Mei Gu, Rong-Xia Hao

Let $F_{v}$ (resp. $F_{e}$ ) be the set of faulty vertices (resp. faulty edges) in the $n$ -dimensional balanced hypercube $B H_{n}$ . Fault-tolerant Hamiltonian laceability in $B H_{n}$ with…

Partial-Twuality Polynomials of Paired Matrices

Partial Petrial Polynomials of Bouquets

Partial Petrial Polynomials of Ribbon Graphs

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

Paired 3-disjoint path covers of balanced hypercubes

Strong Menger connectedness of augmented k-ary n-cubes

Bounds for the rank of a complex unit gain graph in terms of the independence number

On the inertia index of a mixed graph with the matching number

The rank of a complex unit gain graph in terms of the matching number

The relation between the independence number and rank of a signed graph

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

On extremal cacti with respect to the edge Szeged index and edge-vertex Szeged index

Berge-Fulkerson coloring for infinite families of snarks

Fault diagnosability of data center networks

Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs

Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges

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

Strong Menger connectedness of augmented $k$ -ary $n$ -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