The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract). - Shiying Wang; Shangwei Lin 002 (Electron. Notes Discret. Math., 2005)

lambda. - Shiying Wang; Shangwei Lin 002 (Inf. Process. Lett., 2008)

Sufficient conditions for a graph to be super restricted edge-connected. - Shiying Wang; Shangwei Lin 002 (Networks, 2008)

The k-restricted edge connectivity of undirected Kautz graphs. - Shiying Wang; Shangwei Lin 002 (Discret. Math., 2009)

Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2. - Shiying Wang; Shangwei Lin 002; Chunfang Li (Discret. Math., 2009)

Super p-restricted edge connectivity of line graphs. - Shangwei Lin 002; Shiying Wang (Inf. Sci., 2009)

Matching preclusion for k-ary n-cubes. - Shiying Wang; Ruixia Wang; Shangwei Lin 002; Jing Li 048 (Discret. Appl. Math., 2010)

Path embeddings in faulty 3-ary n-cubes. - Shiying Wang; Shangwei Lin 002 (Inf. Sci., 2010)

Neighborhood conditions for graphs to be super restricted edge connected. - Shiying Wang; Jing Li 048; Lihong Wu; Shangwei Lin 002 (Networks, 2010)

Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements. - Shangwei Lin 002; Shiying Wang; Chunfang Li (Discret. Appl. Math., 2011)

Hamiltonian cycles passing through linear forests in k-ary n-cubes. - Shiying Wang; Yuxing Yang; Jing Li 048; Shangwei Lin 002 (Discret. Appl. Math., 2011)

Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges. - Jing Li 048; Shiying Wang; Di Liu 008; Shangwei Lin 002 (Inf. Sci., 2011)

A neighborhood condition for graphs to be maximally k-restricted edge connected. - Shiying Wang; Lei Zhang; Shangwei Lin 002 (Inf. Process. Lett., 2012)

Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes. - Shiying Wang; Jing Li 048; Shangwei Lin 002; Ruixia Wang (Inf. Comput., 2013)

k-restricted edge connectivity in (p+1)-clique-free graphs. - Shiying Wang; Lei Zhang; Shangwei Lin 002 (Discret. Appl. Math., 2015)

The generalized 4-connectivity of hypercubes. - Shangwei Lin 002; Qianhua Zhang (Discret. Appl. Math., 2017)

3-Restricted arc connectivity of digraphs. - Shangwei Lin 002; Ya'nan Jin; Chunfang Li (Discret. Math., 2017)

Arc fault tolerance of Kautz digraphs. - Shangwei Lin 002; Chanchan Zhou; Chunfang Li (Theor. Comput. Sci., 2017)

Structure Connectivity and Substructure Connectivity of (n, k)-Star Graph Networks. - Chunfang Li; Shangwei Lin 002; Shengjia Li (I-SPAN, 2018)

Cartesian product digraphs with optimal restricted arc connectivity. - Shangwei Lin 002; Ya'nan Jin; Chunfang Li (Inf. Process. Lett., 2018)

Path and cycle fault tolerance of bubble-sort graph networks. - Guozhen Zhang; Shangwei Lin 002 (Theor. Comput. Sci., 2019)

The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model. - Shangwei Lin 002; Wenli Zhang (Appl. Math. Comput., 2020)

Structure connectivity and substructure connectivity of star graphs. - Chunfang Li; Shangwei Lin 002; Shengjia Li (Discret. Appl. Math., 2020)

Super Edge-Connected Linear Hypergraphs. - Shangwei Lin 002; Jianfeng Pei; Chunfang Li (Parallel Process. Lett., 2020)

The 4-set tree connectivity of (n, k)-star networks. - Chunfang Li; Shangwei Lin 002; Shengjia Li (Theor. Comput. Sci., 2020)

The 1-good neighbor connectivity of unidirectional star graph networks. - Chunfang Li; Shangwei Lin 002 (Discret. Appl. Math., 2021)

Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model. - Chunfang Li; Shangwei Lin 002; Shengjia Li (Int. J. Found. Comput. Sci., 2021)