Mei-Mei Gu

activity

20162019

k

-ary

n

-cubes

1 citations · 2 across the 5 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

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.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

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…

Paired 3-disjoint path covers of balanced hypercubes

Strong Menger connectedness of augmented k-ary n-cubes

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

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

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