default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuiqiu Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j55]Dandan Fan, Huiqiu Lin:
Binding Number, $k$-Factor and Spectral Radius of Graphs. Electron. J. Comb. 31(1) (2024)- [j54]Longfei Fang, Huiqiu Lin, Jinlong Shu, Zhiyuan Zhang:
Spectral Extremal Results on Trees. Electron. J. Comb. 31(2) (2024) - [j53]Longfei Fang, Mingqing Zhai, Huiqiu Lin:
Spectral Extremal Problem on $t$ Copies of $\ell$-Cycles. Electron. J. Comb. 31(4) (2024) - [j52]Yuanyuan Chen, Dan Li, Huiqiu Lin, Jixiang Meng:
Some graphs determined by their Aα-spectra. Discret. Appl. Math. 348: 46-55 (2024) - [j51]Yuanyuan Chen, Dandan Fan, Huiqiu Lin:
Factors, spectral radius and toughness in bipartite graphs. Discret. Appl. Math. 355: 223-231 (2024) - [j50]Yuke Zhang, Huiqiu Lin:
The sum of the k largest distance eigenvalues of graphs. Discret. Math. 347(1): 113696 (2024) - [j49]Xingkun Song
, Huiqiu Lin:
State transfer on integral mixed circulant graphs. Discret. Math. 347(1): 113727 (2024) - [j48]Yu Wang, Huiqiu Lin, Yingzhi Tian:
Extremal spectral radius and essential edge-connectivity. Discret. Math. 347(6): 113948 (2024) - [j47]Yuanyuan Chen, Dandan Fan, Huiqiu Lin:
Toughness and spectral radius in graphs. Discret. Math. 347(12): 114191 (2024) - 2023
- [j46]Yuke Zhang, Huiqiu Lin:
Graphs with three distinct distance eigenvalues. Appl. Math. Comput. 445: 127848 (2023) - [j45]Dandan Fan, Xueyi Huang, Huiqiu Lin:
Spectral Radius Conditions for the Rigidity of Graphs. Electron. J. Comb. 30(2) (2023) - [j44]Dan Li, Huiqiu Lin, Jixiang Meng:
Extremal spectral results related to spanning trees of signed complete graphs. Discret. Math. 346(2): 113250 (2023) - [j43]Dandan Fan, Huiqiu Lin, Hongliang Lu:
Toughness, hamiltonicity and spectral radius in graphs. Eur. J. Comb. 110: 103701 (2023) - [j42]Mingqing Zhai, Huiqiu Lin:
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs. J. Graph Theory 102(3): 502-520 (2023) - [j41]Dandan Fan, Xiaofeng Gu, Huiqiu Lin:
Spectral radius and edge-disjoint spanning trees. J. Graph Theory 104(4): 697-711 (2023) - 2022
- [j40]Huiqiu Lin, Mingqing Zhai, Yanhua Zhao:
Spectral Radius, Edge-Disjoint Cycles and Cycles of the Same Length. Electron. J. Comb. 29(2) (2022) - [j39]Shamil Asgarli, Sergey Goryainov, Huiqiu Lin, Chi Hoi Yip:
The EKR-Module Property of Pseudo-Paley Graphs of Square Order. Electron. J. Comb. 29(4) (2022) - [j38]Mingqing Zhai, Huiqiu Lin, Yanhua Zhao:
Maximize the Q-index of graphs with fixed order and size. Discret. Math. 345(1): 112669 (2022) - [j37]Dandan Fan, Huiqiu Lin, Hongliang Lu:
Spectral radius and [a, b]-factors in graphs. Discret. Math. 345(7): 112892 (2022) - [j36]Mingqing Zhai, Huiqiu Lin:
Spectral extrema of Ks, t-minor free graphs - On a conjecture of M. Tait. J. Comb. Theory B 157: 184-215 (2022) - 2021
- [j35]Huiqiu Lin, Bo Ning, Baoyindureng Wu:
Eigenvalues and triangles in graphs. Comb. Probab. Comput. 30(2): 258-270 (2021) - [j34]Huiqiu Lin, Yuke Zhang:
Extremal problems on distance spectra of graphs. Discret. Appl. Math. 289: 139-147 (2021) - [j33]Yuke Zhang, Huiqiu Lin:
Perfect matching and distance spectral radius in graphs and bipartite graphs. Discret. Appl. Math. 304: 315-322 (2021) - [j32]Dandan Fan, Sergey Goryainov, Huiqiu Lin:
On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k. Discret. Appl. Math. 305: 154-163 (2021) - [j31]Yanhua Zhao, Xueyi Huang, Huiqiu Lin:
The maximum spectral radius of wheel-free graphs. Discret. Math. 344(5): 112341 (2021) - [j30]Mingqing Zhai, Huiqiu Lin, Jinlong Shu:
Spectral extrema of graphs with fixed size: Cycles and complete bipartite graphs. Eur. J. Comb. 95: 103322 (2021) - [j29]Huiqiu Lin, Bo Ning:
A complete solution to the Cvetković-Rowlinson conjecture. J. Graph Theory 97(3): 441-450 (2021) - 2020
- [j28]Xing Huang, Huiqiu Lin, Jie Xue:
The Nordhaus-Gaddum type inequalities of Aα-matrix. Appl. Math. Comput. 365 (2020) - [j27]Mingqing Zhai, Huiqiu Lin:
Spectral extrema of graphs: Forbidden hexagon. Discret. Math. 343(10): 112028 (2020) - [j26]Huiqiu Lin, Liwen Zhang, Jie Xue:
Majorization, degree sequence and Aα-spectral characterization of graphs. Discret. Math. 343(12): 112132 (2020)
2010 – 2019
- 2019
- [j25]Huiqiu Lin:
On the sum of k largest distance eigenvalues of graphs. Discret. Appl. Math. 259: 153-159 (2019) - [j24]Huiqiu Lin, Xiaogang Liu, Jie Xue:
Graphs determined by their Aα-spectra. Discret. Math. 342(2): 441-450 (2019) - [j23]Stephen W. Drury, Huiqiu Lin:
Corrigendum to "Colorings and spectral radius of digraphs" [Discrete Math. 339 (1) (2016) 327-332]. Discret. Math. 342(11): 3237-3241 (2019) - [j22]Jie Xue, Huiqiu Lin, Jinlong Shu:
The algebraic connectivity of graphs with given circumference. Theor. Comput. Sci. 772: 123-131 (2019) - 2018
- [j21]Huiqiu Lin, Weihua Yang:
A conditional edge connectivity of double-orbit networks. Future Gener. Comput. Syst. 83: 445-449 (2018) - 2017
- [j20]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
- [j19]Huiqiu Lin, Kinkar Chandra Das, Baoyindureng Wu:
Remoteness and distance eigenvalues of a graph. Discret. Appl. Math. 215: 218-224 (2016) - [j18]Stephen W. Drury, Huiqiu Lin:
Colorings and spectral radius of digraphs. Discret. Math. 339(1): 327-332 (2016) - [j17]Zejun Huang, Huiqiu Lin:
Sizes and transmissions of digraphs with a given clique number. J. Comb. Optim. 31(4): 1642-1649 (2016) - [j16]Huiqiu Lin, Jinlong Shu, Baoyindureng Wu:
Maximum size of digraphs with some parameters. J. Comb. Optim. 32(3): 941-950 (2016) - 2015
- [j15]Weihua Yang, Huiqiu Lin, Wei Cai, Xiaofeng Guo:
On cyclic edge connectivity of regular graphs with two orbits. Ars Comb. 119: 135-141 (2015) - [j14]Huiqiu Lin, Lihua Feng:
The distance spectral radius of graphs with given independence number. Ars Comb. 121: 113-123 (2015) - [j13]Huiqiu Lin, Weihua Yang, Jixiang Meng:
λ'-optimal regular graphs with two orbits. Ars Comb. 121: 175-185 (2015) - [j12]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) - [j11]Huiqiu Lin:
On the least distance eigenvalue and its applications on the distance spread. Discret. Math. 338(6): 868-874 (2015) - [j10]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
- [j9]Weihua Yang, Huiqiu Lin:
Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity. IEEE Trans. Computers 63(10): 2540-2548 (2014) - 2013
- [j8]Weihua Yang, Huiqiu Lin, Chengfu Qin:
On the t/k-diagnosability of BC networks. Appl. Math. Comput. 225: 366-371 (2013) - [j7]Huiqiu Lin, Jinlong Shu:
The distance spectral radius of digraphs. Discret. Appl. Math. 161(16-17): 2537-2543 (2013) - [j6]Huiqiu Lin, Stephen W. Drury:
The maximum Perron roots of digraphs with some given parameters. Discret. Math. 313(22): 2607-2613 (2013) - 2012
- [j5]Huiqiu Lin, Jixiang Meng, Weihua Yang:
Super restricted edge connectivity of regular graphs with two orbits. Appl. Math. Comput. 218(12): 6656-6660 (2012) - [j4]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) - [j3]Huiqiu Lin, Weihua Yang, Hailiang Zhang, Jinlong Shu:
Distance spectral radius of digraphs with given connectivity. Discret. Math. 312(11): 1849-1856 (2012) - [j2]Huiqiu Lin, Jinlong Shu, Yarong Wu, Guanglong Yu:
Spectral radius of strongly connected digraphs. Discret. Math. 312(24): 3663-3669 (2012) - 2011
- [j1]Huiqiu Lin, Weihua Yang, Hailiang Zhang, Jinlong Shu:
Outerplanarity of line graphs and iterated line graphs. Appl. Math. Lett. 24(7): 1214-1217 (2011)
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-11-08 20:28 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:
