![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Jinlong Shu
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j53]Longfei Fang, Huiqiu Lin, Jinlong Shu, Zhiyuan Zhang:
Spectral Extremal Results on Trees. Electron. J. Comb. 31(2) (2024) - [j52]Xin Li, Mingqing Zhai, Jinlong Shu:
A Brualdi-Hoffman-Turán problem on cycles. Eur. J. Comb. 120: 103966 (2024) - [c2]Keren Tan, Kangyang Luo, Yunshi Lan, Zheng Yuan, Jinlong Shu:
An LLM-Enhanced Adversarial Editing System for Lexical Simplification. LREC/COLING 2024: 1136-1146 - [i1]Keren Tan, Kangyang Luo, Yunshi Lan, Zheng Yuan, Jinlong Shu:
An LLM-Enhanced Adversarial Editing System for Lexical Simplification. CoRR abs/2402.14704 (2024) - 2023
- [j51]Jie Xue, Ruifang Liu, Jiaxin Guo, Jinlong Shu:
The maximum spectral radius of irregular bipartite graphs. Adv. Appl. Math. 142: 102433 (2023) - 2022
- [j50]Tao Wu, Jinde Cao, Lianglin Xiong, Haiyang Zhang, Jinlong Shu:
Sampled-data synchronization criteria for Markovian jumping neural networks with additive time-varying delays using new techniques. Appl. Math. Comput. 413: 126604 (2022) - [j49]Jinlong Shu, Baowei Wu, Lianglin Xiong:
Stochastic stability criteria and event-triggered control of delayed Markovian jump quaternion-valued neural networks. Appl. Math. Comput. 420: 126904 (2022) - [j48]Mingqing Zhai, Jinlong Shu:
A spectral version of Mantel's theorem. Discret. Math. 345(1): 112630 (2022) - 2021
- [j47]Jinlong Shu, Baowei Wu, Lianglin Xiong, Tao Wu
, Haiyang Zhang:
Stochastic stabilization of Markov jump quaternion-valued neural network using sampled-data control. Appl. Math. Comput. 400: 126041 (2021) - [j46]Jie Xue, Ruifang Liu, Jinlong Shu:
On graphs whose third largest distance eigenvalue dose not exceed -1. Appl. Math. Comput. 402: 126137 (2021) - [j45]Mingqing Zhai, Huiqiu Lin, Jinlong Shu:
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs. Eur. J. Comb. 95: 103322 (2021) - [j44]Mingqing Zhai
, Longfei Fang, Jinlong Shu:
On the Turán Number of Theta Graphs. Graphs Comb. 37(6): 2155-2165 (2021) - 2020
- [j43]Xiaoman Liu, Haiyang Zhang
, Tao Wu
, Jinlong Shu
:
Stochastic Exponential Stabilization for Markov Jump Neural Networks with Time-varying Delays via Adaptive Event-Triggered Impulsive Control. Complex. 2020: 3956549:1-3956549:15 (2020) - [j42]Shuting Liu, Kinkar Chandra Das
, Jinlong Shu:
On the eigenvalues of Aα-matrix of graphs. Discret. Math. 343(8): 111917 (2020) - [j41]Jie Xue
, Ruifang Liu, Jinlong Shu:
Unimodality of Principal Eigenvector and its Applications. Graphs Comb. 36(4): 1177-1188 (2020)
2010 – 2019
- 2019
- [j40]Jie Xue
, Huiqiu Lin, Jinlong Shu:
The algebraic connectivity of graphs with given circumference. Theor. Comput. Sci. 772: 123-131 (2019) - 2018
- [j39]Jie Xue, Shuting Liu, Jinlong Shu:
The complements of path and cycle are determined by their distance (signless) Laplacian spectra. Appl. Math. Comput. 328: 137-143 (2018) - 2017
- [j38]Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Nordhaus-Gaddum type result for the matching number of a graph. J. Comb. Optim. 34(3): 916-930 (2017) - 2016
- [j37]Guanglong Yu, Yarong Wu, Jinlong Shu:
Minimizing the least eigenvalue of bicyclic graphs with fixed diameter. Ars Comb. 124: 421-437 (2016) - [j36]Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Maximum size of digraphs with some parameters. J. Comb. Optim. 32(3): 941-950 (2016) - 2015
- [j35]Huiqiu Lin, Jinlong Shu:
Corrigendum to "The distance spectral radius of digraphs": [Discrete Appl. Math. 161 (2013) 2537-2543]. Discret. Appl. Math. 188: 51-52 (2015) - [j34]Huiqiu Lin, Yuan Hong, Jinlong Shu:
Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph. Graphs Comb. 31(3): 669-677 (2015) - 2014
- [j33]Guanglong Yu, Zhengke Miao, Chao Yan, Jinlong Shu:
The extremal primitive digraph with both Lewin index n-2 and girth 2 or 3. Ars Comb. 115: 401-410 (2014) - [j32]Yarong Wu, Guanglong Yu, Jinlong Shu:
Graphs with small second largest Laplacian eigenvalue. Eur. J. Comb. 36: 190-197 (2014) - 2013
- [j31]Huiqiu Lin, Jinlong Shu:
The distance spectral radius of digraphs. Discret. Appl. Math. 161(16-17): 2537-2543 (2013) - 2012
- [j30]Guanglong Yu, Huicai Jia, Hailiang Zhang, Jinlong Shu:
Some graft transformations and its applications on the distance spectral radius of a graph. Appl. Math. Lett. 25(3): 315-319 (2012) - [j29]Ruifang Liu, Huicai Jia, Jinlong Shu:
Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices. Ars Comb. 103: 19-32 (2012) - [j28]Yarong Wu, Jinlong Shu, Yuan Hong:
The Minimal Limit Point of the Third Largest Laplacian Eigenvalues of Graphs. Ars Comb. 103: 119-127 (2012) - [j27]Mingqing Zhai, Guanglong Yu, Jinlong Shu:
Clique number and distance spectral radii of graphs. Ars Comb. 104: 385-392 (2012) - [j26]Hailiang Zhang, Jinlong Shu:
On the matching polynomial of theta graphs. Ars Comb. 105: 477-490 (2012) - [j25]Guanglong Yu, Hailiang Zhang, Huiqiu Lin, Yarong Wu, Jinlong Shu:
Distance spectral spread of a graph. Discret. Appl. Math. 160(16-17): 2474-2478 (2012) - [j24]Huiqiu Lin, Weihua Yang, Hailiang Zhang, Jinlong Shu:
Distance spectral radius of digraphs with given connectivity. Discret. Math. 312(11): 1849-1856 (2012) - [j23]Huiqiu Lin, Jinlong Shu, Yarong Wu, Guanglong Yu:
Spectral radius of strongly connected digraphs. Discret. Math. 312(24): 3663-3669 (2012) - [j22]Jinlong Shu, Cun-Quan Zhang, Taoye Zhang:
Flows and parity subgraphs of graphs with large odd-edge-connectivity. J. Comb. Theory B 102(4): 839-851 (2012) - [j21]Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of primitive nonpowerful sign patterns. Theor. Comput. Sci. 447: 136-143 (2012) - 2011
- [j20]Huiqiu Lin, Weihua Yang, Hailiang Zhang, Jinlong Shu:
Outerplanarity of line graphs and iterated line graphs. Appl. Math. Lett. 24(7): 1214-1217 (2011) - [j19]Mingqing Zhai, Jinlong Shu, Yuan Hong:
On the Laplacian spread of graphs. Appl. Math. Lett. 24(12): 2097-2101 (2011) - [j18]Mingqing Zhai, Ruifang Liu, Jinlong Shu:
On the (Laplacian) spectral radius of bipartite graphs with given number of blocks. Ars Comb. 98: 311-319 (2011) - [j17]Ruifang Liu, Huicai Jia, Jinlong Shu:
On the spectra of tricyclic graphs. Ars Comb. 100: 19-32 (2011) - [j16]Guanglong Yu, Zhengke Miao, Jinlong Shu:
The base of a primitive, nonpowerful sign pattern with exactly d nonzero diagonal entries. Discret. Math. 311(6): 493-503 (2011) - [j15]Guanglong Yu, Yarong Wu, Yajie Zhang, Jinlong Shu:
Some graft transformations and its application on a distance spectrum. Discret. Math. 311(20): 2117-2123 (2011) - 2010
- [j14]Yusheng Li, Jinlong Shu:
A lower bound for off-diagonal van der Waerden numbers. Adv. Appl. Math. 44(3): 243-247 (2010) - [j13]Mingqing Zhai, Guanglong Yu, Jinlong Shu:
The Laplacian spectral radius of bicyclic graphs with a given girth. Comput. Math. Appl. 59(1): 376-381 (2010) - [j12]Yuanqing Lin, Jinlong Shu, Yao Meng:
Laplacian spectrum characterization of extensions of vertices of wheel graphs and multi-fan graphs. Comput. Math. Appl. 60(7): 2003-2008 (2010) - [j11]Mingqing Zhai, Ruifang Liu, Jinlong Shu:
Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. Discret. Math. 310(4): 947-955 (2010) - [j10]Evelyne Flandrin, Ervin Györi, Hao Li, Jinlong Shu:
Cyclability in k-connected K1, 4-free graphs. Discret. Math. 310(20): 2735-2741 (2010) - [j9]Yarong Wu, Jinlong Shu:
The spread of the unicyclic graphs. Eur. J. Comb. 31(1): 411-418 (2010) - [c1]Guanglong Yu, Zhengke Miao, Jinlong Shu:
Bases of Primitive Nonpowerful Sign Patterns. COCOA (1) 2010: 114-127
2000 – 2009
- 2009
- [j8]Ruifang Liu, Zhonghua Lu, Jinlong Shu:
The minimal Laplacian spectral radius of trees with a given diameter. Theor. Comput. Sci. 410(1): 78-83 (2009) - 2007
- [j7]Hao Li, Evelyne Flandrin, Jinlong Shu:
A sufficient condition for cyclability in directed graphs. Discret. Math. 307(11-12): 1291-1297 (2007) - 2005
- [j6]Hao Li, Jinlong Shu:
The partition of a strong tournament. Discret. Math. 290(2/3): 211-220 (2005) - [j5]Jinlong Shu, Cun-Quan Zhang:
A note about shortest cycle covers. Discret. Math. 301(2-3): 232-238 (2005) - [j4]Jinlong Shu, Cun-Quan Zhang:
Nowhere-zero 3-flows in products of graphs. J. Graph Theory 50(1): 79-89 (2005) - 2004
- [j3]Hao Li, Jinlong Shu:
Partitioning a strong tournament into k cycles. Ars Comb. 72 (2004) - 2001
- [j2]Yuan Hong, Jinlong Shu, Kunfu Fang:
A Sharp Upper Bound of the Spectral Radius of Graphs. J. Comb. Theory B 81(2): 177-183 (2001) - 2000
- [j1]Yuan Hong, Jinlong Shu:
A sharp upper bound for the spectral radius of the Nordhaus-Gaddum type. Discret. Math. 211: 229-232 (2000)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-03 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint