default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShangwei Lin 0002
Person information
- affiliation: Shanxi University, School of Mathematical Sciences, China
Other persons with the same name
- Shangwei Lin (aka: Shang-Wei Lin) — disambiguation page
- Shangwei Lin 0001
![[0000-0002-9726-3434]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-9726-3434")
(aka: Shang-Wei Lin 0001) — Nanyang Technological University, College of Engineering, Singapore (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j26]Chunfang Li, Shangwei Lin:
The 1-good neighbor connectivity of unidirectional star graph networks. Discret. Appl. Math. 304: 1-11 (2021)- [j25]Chunfang Li, Shangwei Lin, Shengjia Li:
Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model. Int. J. Found. Comput. Sci. 32(1): 53-72 (2021) - 2020
- [j24]Shangwei Lin, Wenli Zhang:
The 1-good-neighbor diagnosability of unidirectional hypercubes under the PMC model. Appl. Math. Comput. 375: 125091 (2020) - [j23]Chunfang Li, Shangwei Lin, Shengjia Li:
Structure connectivity and substructure connectivity of star graphs. Discret. Appl. Math. 284: 472-480 (2020) - [j22]Shangwei Lin, Jianfeng Pei, Chunfang Li:
Super Edge-Connected Linear Hypergraphs. Parallel Process. Lett. 30(3): 2040003:1-2040003:10 (2020) - [j21]Chunfang Li, Shangwei Lin, Shengjia Li:
The 4-set tree connectivity of (n, k)-star networks. Theor. Comput. Sci. 844: 81-86 (2020)
2010 – 2019
- 2019
- [j20]Guozhen Zhang, Shangwei Lin:
Path and cycle fault tolerance of bubble-sort graph networks. Theor. Comput. Sci. 779: 8-16 (2019) - 2018
- [j19]Shangwei Lin, Ya'nan Jin, Chunfang Li:
Cartesian product digraphs with optimal restricted arc connectivity. Inf. Process. Lett. 134: 72-75 (2018) - [c1]Chunfang Li, Shangwei Lin, Shengjia Li:
Structure Connectivity and Substructure Connectivity of (n, k)-Star Graph Networks. I-SPAN 2018: 240-246 - 2017
- [j18]Shangwei Lin, Qianhua Zhang:
The generalized 4-connectivity of hypercubes. Discret. Appl. Math. 220: 60-67 (2017) - [j17]Shangwei Lin, Ya'nan Jin, Chunfang Li:
3-Restricted arc connectivity of digraphs. Discret. Math. 340(10): 2341-2348 (2017) - [j16]Shangwei Lin, Chanchan Zhou, Chunfang Li:
Arc fault tolerance of Kautz digraphs. Theor. Comput. Sci. 687: 1-10 (2017) - 2015
- [j15]Shiying Wang, Lei Zhang, Shangwei Lin:
k-restricted edge connectivity in (p+1)-clique-free graphs. Discret. Appl. Math. 181: 255-259 (2015) - 2013
- [j14]Shiying Wang, Jing Li, Shangwei Lin, Ruixia Wang:
Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes. Inf. Comput. 230: 55-66 (2013) - 2012
- [j13]Shiying Wang, Lei Zhang, Shangwei Lin:
A neighborhood condition for graphs to be maximally k-restricted edge connected. Inf. Process. Lett. 112(3): 95-97 (2012) - 2011
- [j12]Shangwei Lin, Shiying Wang, Chunfang Li:
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements. Discret. Appl. Math. 159(4): 212-223 (2011) - [j11]Shiying Wang, Yuxing Yang, Jing Li, Shangwei Lin:
Hamiltonian cycles passing through linear forests in k-ary n-cubes. Discret. Appl. Math. 159(14): 1425-1435 (2011) - [j10]Jing Li, Shiying Wang, Di Liu, Shangwei Lin:
Edge-bipancyclicity of the k-ary n-cubes with faulty nodes and edges. Inf. Sci. 181(11): 2260-2267 (2011) - 2010
- [j9]Shiying Wang, Ruixia Wang, Shangwei Lin, Jing Li:
Matching preclusion for k-ary n-cubes. Discret. Appl. Math. 158(18): 2066-2070 (2010) - [j8]Shiying Wang, Shangwei Lin:
Path embeddings in faulty 3-ary n-cubes. Inf. Sci. 180(1): 191-197 (2010) - [j7]Shiying Wang, Jing Li, Lihong Wu, Shangwei Lin:
Neighborhood conditions for graphs to be super restricted edge connected. Networks 56(1): 11-19 (2010)
2000 – 2009
- 2009
- [j6]Shiying Wang, Shangwei Lin, Chunfang Li:
Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2. Discret. Math. 309(4): 908-919 (2009) - [j5]Shiying Wang, Shangwei Lin:
The k-restricted edge connectivity of undirected Kautz graphs. Discret. Math. 309(13): 4649-4652 (2009) - [j4]Shangwei Lin, Shiying Wang:
Super p-restricted edge connectivity of line graphs. Inf. Sci. 179(18): 3122-3126 (2009) - 2008
- [j3]Shiying Wang, Shangwei Lin:
lambda. Inf. Process. Lett. 108(6): 386-389 (2008) - [j2]Shiying Wang, Shangwei Lin:
Sufficient conditions for a graph to be super restricted edge-connected. Networks 51(3): 200-209 (2008) - 2005
- [j1]Shiying Wang, Shangwei Lin:
The maximal restricted edge connectivity of Kautz undirected graphs: (extended abstract). Electron. Notes Discret. Math. 22: 49-53 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
