default search action
Wenshui Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j13]Yuehan Wu, Chengxi Hong, Peifang Fu, Wenshui Lin
:
Large trees with maximal inverse sum indeg index have no vertices of degree 2 or 3. Discret. Appl. Math. 360: 131-138 (2025) - 2023
- [j12]Chaohui Chen, Wenshui Lin
On the general Z-type index of connected graphs. Discret. Optim. 50: 100808 (2023) - 2022
- [j11]Wenshui Lin
On two conjectures concerning trees with maximal inverse sum indeg index. Comput. Appl. Math. 41(6) (2022) - [j10]Jia-Bao Liu
The Kirchhoff index and spanning trees of Möbius/cylinder octagonal chain. Discret. Appl. Math. 307: 22-31 (2022) - [j9]Chaohui Chen, Muhuo Liu
On general ABC-type index of connected graphs. Discret. Appl. Math. 315: 27-35 (2022) - [j8]Mingzu Zhang, Hongxi Liu, Wenshui Lin:
A unified approach to reliability and edge fault tolerance of cube-based interconnection networks under three hypotheses. J. Supercomput. 78(6): 7936-7947 (2022) - 2021
- [j7]Xiaodan Chen, Xiuyu Li, Wenshui Lin:
On connected graphs and trees with maximal inverse sum indeg index. Appl. Math. Comput. 392: 125731 (2021) - 2020
- [j6]Xiuliang Qiu, Wenshui Lin
Function Projective Synchronization of Complex Networks With Distributed Delays via Hybrid Feedback Control. IEEE Access 8: 99110-99114 (2020)
2010 – 2019
- 2018
- [j5]Wenshui Lin, Akbar Ali
On the Trees With Maximal Augmented Zagreb Index. IEEE Access 6: 69335-69341 (2018) - [j4]Litao Guo
Fault tolerance of locally twisted cubes. Appl. Math. Comput. 334: 401-406 (2018) - [j3]Wenshui Lin, Jianfeng Chen, Zhixi Wu, Darko Dimitrov
Computer search for large trees with minimal ABC index. Appl. Math. Comput. 338: 221-230 (2018) - 2017
- [j2]Wenshui Lin, Peixi Li, Jianfeng Chen, Chi Ma, Yuan Zhang, Dongzhan Zhang:
On the minimal ABC index of trees with k leaves. Discret. Appl. Math. 217: 622-627 (2017) - 2016
- [j1]Wenshui Lin, Yuan Zhang, Qi'an Chen, Jiwen Chen, Chi Ma, Junjie Chen:
Ordering trees by their distance spectral radii. Discret. Appl. Math. 203: 106-110 (2016) - 2011
- [c1]Wenshui Lin, Jinping Xu, Jiandong Wang, Xinyou Wu:
A Bricklaying Best-Fit Heuristic Algorithm for the Orthogonal Rectangle Packing Problem. ICAIC (2) 2011: 638-643
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-12-02 22:31 CET 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: