Huiqiu Lin

dblp:62/9443 · DBLP profile ↗
← Back
14ranked-venue papers
6as first author
6since 2021 · last 2025
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 12 · 5 first-author · 6 since 2021Systems, architecture and hardware · 2 · 1 first-author
YearPublicationVenuePosition
2025 The largest eigenvalue of C-k-free signed graphs
Yongang Wang, Huiqiu Lin
Discret. Appl. Math.2
2024 Factors, spectral radius and toughness in bipartite graphs
Huiqiu Lin
Discret. Appl. Math.3
2024 Some graphs determined by their Aα-spectra
Dan Li 0031, Huiqiu Lin, Jixiang Meng
Discret. Appl. Math.3
2021 On the (signless Laplacian) spectral radius of minimally k-(edge)-connected graphs for small k
Sergey Goryainov, Huiqiu Lin
Discret. Appl. Math.3
2021 Extremal problems on distance spectra of graphs
Huiqiu Lin
Discret. Appl. Math.1
2021 Perfect matching and distance spectral radius in graphs and bipartite graphs
Huiqiu Lin
Discret. Appl. Math.2
2019 On the sum of k largest distance eigenvalues of graphs
Huiqiu Lin
Discret. Appl. Math.1
2019 The algebraic connectivity of graphs with given circumference
Jie Xue 0004, Huiqiu Lin, Jinlong Shu
Theor. Comput. Sci.2
2018 A conditional edge connectivity of double-orbit networks
Huiqiu Lin, Weihua Yang
Future Gener. Comput. Syst.1
2016 Remoteness and distance eigenvalues of a graph
Huiqiu Lin, Kinkar Chandra Das, Baoyindureng Wu
Discret. Appl. Math.1
2015 Corrigendum to "The distance spectral radius of digraphs": [Discrete Appl. Math. 161 (2013) 2537-2543]
Huiqiu Lin, Jinlong Shu
Discret. Appl. Math.1
2014 Reliability Evaluation of BC Networks in Terms of the Extra Vertex- and Edge-Connectivity
abstract
Reliability evaluation of interconnection network is important to the design and maintenance of multiprocessor systems. The extra connectivity and the extra edge-connectivity are two important parameters for the reliability evaluation of interconnection networks. The${\mbi {n}}$-dimensional bijective connection network (in brief, BC network) includes several well known network models, such as, hypercubes, Möbius cubes, crossed cubes, and twisted cubes. In this paper, we explore the extra connectivity and the extra edge-connectivity of BC networks, and discuss the structure of BC networks with many faults. We obtain a sharp lower bound of${{g}}$-extra edge-connectivity of an${\mbi {n}}$-dimensional BC network for${{n}} \geq 4$and$1 \leq { {g}} \leq {2^{[{{{n}} \over 2}]}}$. We also obtain a sharp lower bound of${ {g}}$-extra connectivity of an${{n}}$-dimensional BC network for${{n}} \geq 4$and$1 \leq { {g}} \leq 2{ {n}}$which improves the result in [“Reliability evaluation of BC networks,” IEEE Trans. Computers, DOI: 10.1109/tc.2012.106.] for$1 \leq { {g}} \leq { {n}} - 3$. Furthermore, we give a remark about exploring the${ {g}}$-extra edge-connectivity of BC networks for the more general${\mbi {g}}$, and we also characterize the structure of BC networks with many faulty nodes or links. As an application, we obtain several results on the${\mbi {g}}$-extra (edge-) connectivity and the structure of faulty networks on hypercubes, Möbius cubes, crossed cubes, and twisted cubes.
Weihua Yang, Huiqiu Lin
IEEE Trans. Computers2
2013 The distance spectral radius of digraphs
Huiqiu Lin, Jinlong Shu
Discret. Appl. Math.1
2012 Distance spectral spread of a graph
Guanglong Yu, Huiqiu Lin, Yarong Wu, Jinlong Shu
Discret. Appl. Math.3