Pingshan Li

collaborators

2 papers

math.CO2021

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…

math.CO2016

The super spanning connectivity of arrangement graph

Pingshan Li, Min Xu

A $k$ -container $C (u, v)$ of a graph $G$ is a set of $k$ internally disjoint paths between $u$ and $v$ . A $k$ -container $C (u, v)$ of $G$ is a $k^{*}$ -container if it is a spanning su…