Shangwei Lin

According to our database, Shangwei Lin authored at least 27 papers between 2005 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model.

Chunfang Li, Shangwei Lin, Shengjia Li

Int. J. Found. Comput. Sci., 2021

The 1-good neighbor connectivity of unidirectional star graph networks.

Chunfang Li, Shangwei Lin

Discret. Appl. Math., 2021

2020

The 4-set tree connectivity of (<i>n</i>, <i>k</i>)-star networks.

Chunfang Li, Shangwei Lin, Shengjia Li

Theor. Comput. Sci., 2020

Super Edge-Connected Linear Hypergraphs.

Shangwei Lin, Jianfeng Pei, Chunfang Li

Parallel Process. Lett., 2020

Structure connectivity and substructure connectivity of star graphs.

Chunfang Li, Shangwei Lin, Shengjia Li

Discret. Appl. Math., 2020

The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model.

Shangwei Lin, Wenli Zhang

Appl. Math. Comput., 2020

2019

Path and cycle fault tolerance of bubble-sort graph networks.

Guozhen Zhang, Shangwei Lin

Theor. Comput. Sci., 2019

2018

Cartesian product digraphs with optimal restricted arc connectivity.

Shangwei Lin, Ya'nan Jin, Chunfang Li

Inf. Process. Lett., 2018

Structure Connectivity and Substructure Connectivity of (n, k)-Star Graph Networks.

Chunfang Li, Shangwei Lin, Shengjia Li

Proceedings of the 15th International Symposium on Pervasive Systems, 2018

2017

Arc fault tolerance of Kautz digraphs.

Shangwei Lin, Chanchan Zhou, Chunfang Li

Theor. Comput. Sci., 2017

3-Restricted arc connectivity of digraphs.

Shangwei Lin, Ya'nan Jin, Chunfang Li

Discret. Math., 2017

The generalized 4-connectivity of hypercubes.

Shangwei Lin, Qianhua Zhang

Discret. Appl. Math., 2017

2015

k-restricted edge connectivity in (p+1)-clique-free graphs.

Shiying Wang, Lei Zhang, Shangwei Lin

Discret. Appl. Math., 2015

2013

Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes.

Shiying Wang, Jing Li, Shangwei Lin, Ruixia Wang

Inf. Comput., 2013

2012

A neighborhood condition for graphs to be maximally k-restricted edge connected.

Shiying Wang, Lei Zhang, Shangwei Lin

Inf. Process. Lett., 2012

2011

Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges.

Jing Li, Shiying Wang, Di Liu, Shangwei Lin

Inf. Sci., 2011

Hamiltonian cycles passing through linear forests in k-ary n-cubes.

Shiying Wang, Yuxing Yang, Jing Li, Shangwei Lin

Discret. Appl. Math., 2011

Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements.

Shangwei Lin, Shiying Wang, Chunfang Li

Discret. Appl. Math., 2011

2010

Neighborhood conditions for graphs to be super restricted edge connected.

Shiying Wang, Jing Li, Lihong Wu, Shangwei Lin

Networks, 2010

Path embeddings in faulty 3-ary n-cubes.

Shiying Wang, Shangwei Lin

Inf. Sci., 2010

Matching preclusion for k-ary n-cubes.

Shiying Wang, Ruixia Wang, Shangwei Lin, Jing Li

Discret. Appl. Math., 2010

2009

Super p-restricted edge connectivity of line graphs.

Shangwei Lin, Shiying Wang

Inf. Sci., 2009

Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2.

Shiying Wang, Shangwei Lin, Chunfang Li

Discret. Math., 2009

The k-restricted edge connectivity of undirected Kautz graphs.

Shiying Wang, Shangwei Lin

Discret. Math., 2009

2008

Sufficient conditions for a graph to be super restricted edge-connected.

Shiying Wang, Shangwei Lin

Networks, 2008

lambda.

Shiying Wang, Shangwei Lin

Inf. Process. Lett., 2008

2005

The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract).

Shiying Wang, Shangwei Lin

Electron. Notes Discret. Math., 2005