default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYinkui Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Yinkui Li, Guiyu Shi, Xiaoxiao Qin
:
Graphs with burning number three. Appl. Math. Comput. 487: 129100 (2025)- 2023
- [j18]Yinkui Li, Liqun Wei:
Note for the conjecture on the generalized 4-connectivity of total graphs of the complete bipartite graph. Appl. Math. Comput. 458: 128225 (2023) - [j17]Ning Zhao, Haixing Zhao, Yinkui Li:
A Vulnerability Measure of k-Uniform Linear Hypergraphs. Symmetry 15(6): 1187 (2023) - 2021
- [j16]Yinkui Li, Xiaoxiao Qin, Wen Li:
The generalized burning number of graphs. Appl. Math. Comput. 411: 126306 (2021) - [j15]Ning Zhao, Yinkui Li:
The Vulnerability of k-Uniform Linear Hypergraph. J. Interconnect. Networks 21(4): 2142003:1-2142003:9 (2021) - [j14]Xiaoxiao Qin, Ting Xie, Wen Li, Yinkui Li:
Extremal Graphs on the Rupture Degree. J. Interconnect. Networks 21(4): 2142012:1-2142012:8 (2021) - 2020
- [j13]Yinkui Li, Xiaoxiao Qin, Fengwei Li, Wen Li:
Note for Constructing Minimum Integrity Trees with Given Order and Maximum Degree*. J. Interconnect. Networks 20(3): 2050012:1-2050012:6 (2020)
2010 – 2019
- 2019
- [j12]Yinkui Li, Ruijuan Gu, Hui Lei:
The generalized connectivity of the line graph and the total graph for the complete bipartite graph. Appl. Math. Comput. 347: 645-652 (2019) - [j11]Zongtian Wei, Chao Yue, Yinkui Li, Hongyun Yue, Yong Liu:
A polynomial algorithm for computing the weak rupture degree of trees. Appl. Math. Comput. 361: 730-734 (2019) - 2018
- [j10]Yinkui Li, Ruijuan Gu:
Bounds for scattering number and rupture degree of graphs with genus. Appl. Math. Comput. 337: 329-334 (2018) - [j9]Yinkui Li, Yongtang Shi, Xiaofeng Gu:
Spectrum bounds for the scattering number, integrity, tenacity of regular graphs. Future Gener. Comput. Syst. 83: 450-453 (2018) - 2017
- [j8]Yinkui Li:
Cycle multiplicity of some total graphs. Appl. Math. Comput. 292: 107-113 (2017) - [j7]Yinkui Li, Mingzhe Du, Hongyan Li, Xiaolin Wang:
Edge Rupture Degree of Graphs. Int. J. Found. Comput. Sci. 28(8): 993-1006 (2017) - 2015
- [j6]Guantao Chen, Yinkui Li, Haicheng Ma, Tingzeng Wu, Liming Xiong:
An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets. Graphs Comb. 31(4): 885-896 (2015) - 2014
- [j5]Yinkui Li, Zongtian Wei, Xiaokui Yue, Erqiang Liu:
Tenacity of total graphs. Int. J. Found. Comput. Sci. 25(5): 553-562 (2014) - 2010
- [j4]Yinkui Li, Shenggui Zhang:
Extremal graphs with given order and the rupture degree. Comput. Math. Appl. 60(6): 1706-1710 (2010)
2000 – 2009
- 2008
- [j3]Yinkui Li, Shenggui Zhang, Qilong Zhang:
Vulnerability parameters of split graphs. Int. J. Comput. Math. 85(1): 19-23 (2008) - [j2]Yinkui Li:
The rupture degree of trees. Int. J. Comput. Math. 85(11): 1629-1635 (2008) - 2005
- [j1]Yinkui Li, Shenggui Zhang, Xueliang Li:
Rupture degree of graphs. Int. J. Comput. Math. 82(7): 793-803 (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 2025-01-21 00:13 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:
