24 citations · 35 across the 9 of their papers we have counts for
Showing 2019Show all
3 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 , 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…
cs.DM2019★ 1 cited
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…
math.CO2019★ 1 cited
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…