24 citations · 35 across the 9 of their papers we have counts for
4 papers · 1 filter
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…
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…
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…