Jinlong Shu
About
In The Last Decade
Jinlong Shu
86 papers receiving 912 citations
Peers
Comparison fields: 5 of 48
- Geometry and Topology 871
- Computational Theory and Mathematics 724
- Discrete Mathematics and Combinatorics 272
- Organic Chemistry 272
- Electrical and Electronic Engineering 67
Countries citing papers authored by Jinlong Shu
This map shows the geographic impact of Jinlong Shu's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jinlong Shu with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jinlong Shu more than expected).
Fields of papers citing papers by Jinlong Shu
This network shows the impact of papers produced by Jinlong Shu. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jinlong Shu. The network helps show where Jinlong Shu may publish in the future.
Co-authorship network of co-authors of Jinlong Shu
This figure shows the co-authorship network connecting the top 25 collaborators of Jinlong Shu. A scholar is included among the top collaborators of Jinlong Shu based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jinlong Shu. Jinlong Shu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 10 | |
| 3 | 9 | |
| 4 | 3 | |
| 5 | 11 | |
| 6 | 35 | |
| 7 | On the matching polynomial of theta graphs. | 0 |
| 8 | Clique number and distance spectral radii of graphs. | 5 |
| 9 | Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices. | 1 |
| 10 | On the spectra of tricyclic graphs. | 1 |
| 11 | Upper bounds on the spectral radius of k trees | 6 |
| 12 | Properties of a new class of transformation graphs | 1 |
| 13 | 3 | |
| 14 | 18 | |
| 15 | Ordering of trees with respect to their spectral radius of Nordhaus-Gaddum type | 2 |
| 16 | On the Spectral Radius of Trees with Fixed Maximal Degree | 1 |
| 17 | 1 | |
| 18 | Partitioning a strong tournament into k cycles. | 1 |
| 19 | Upper Bounds on the Spectral Radius of Digraphs | 1 |
| 20 | On Trees Whose Second Largest Eigenvalue Does Not Exceed 1 | 5 |
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.