24 citations · 35 across the 9 of their papers we have counts for
9 papers
Paired 3-disjoint path covers of balanced hypercubes
Mei-Rong Guo, Rong-Xia Hao, Mei-Mei Gu
The balanced hypercube , proposed by Wu and Huang, is a variation of the hypercube. The paired 1-disjoint path cover of is the Hamiltonian laceability, which was o…
Neighbor connectivity of -ary -cubes
Tomáš Dvořák, Mei-Mei Gu
The neighbor connectivity of a graph is the least number of vertices such that removing their closed neighborhoods from results in a graph that is disconnected, complete or…
Strong Menger connectedness of augmented -ary -cubes
Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao
A connected graph is called strongly Menger (edge) connected if for any two distinct vertices of , there are vertex(edge)-dis…
The Component Connectivity of Alternating Group Graphs and Split-Stars
Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang
For an integer , the -component connectivity of a graph , denoted by , is the minimum number of vertices whose removal from results in a…
Fault diagnosability of data center networks
Mei-Mei Gu, Rong-Xia Hao, Shuming Zhou
The data center networks , proposed in 2008, has many desirable features such as high network capacity. A kind of generalization of diagnosability for network is -g…
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…
Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges
Mei-Mei Gu, Rong-Xia Hao
Let (resp. ) be the set of faulty vertices (resp. faulty edges) in the -dimensional balanced hypercube . Fault-tolerant Hamiltonian laceability in with…
3-extra connectivity of 3-ary n-cube networks
Meimei Gu, Rongxia Hao
Let G be a connected graph and S be a set of vertices. The h-extra connectivity of G is the cardinality of a minimum set S such that G-S is disconnected and each component of G-S h…
On 3-extra connectivity of k-ary n-cubes
Mei-Mei Gu, Rong-Xia Hao, Jian-Bing Liu
Given a graph G, a non-negative integer h and a set of vertices S, the h-extra connectivity of G is the cardinality of a minimum set S such that G-S is disconnected and each compon…