Rongxia Hao

activity

20162019

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

3 citations · 4 across the 7 of their papers we have counts for

collaborators

18 papers

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

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

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…

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

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