3 citations · 3 across the 4 of their papers we have counts for
4 papers
Component Edge Connectivity of Hypercube-like Networks
Dong Liu, Pingshan Li, Bicheng Zhang
As a generalization of the traditional connectivity, the g-component edge connectivity cλg(G) of a non-complete graph G is the minimum number of edges to be deleted from the graph…
Fault-free Hamiltonian cycles in balanced hypercube with conditional edge faults
Pingshan Li, Min Xu
The balanced hypercube, , is a variant of hypercube . Zhou et al. [Inform. Sci. 300 (2015) 20-27] proposed an interesting problem that whether there is a fault-free Hami…
The super spanning connectivity of arrangement graph
Pingshan Li, Min Xu
A -container of a graph is a set of internally disjoint paths between and . A -container of is a -container if it is a spanning su…
Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
Pingshan Li, Min Xu
The balanced hypercube, , is a variant of hypercube . R.X. Hao et al. \cite{R.X.Hao} showed that there exists a fault-free Hamiltonian path between any two adja…