Cun‐Quan Zhang
-
- Limits and Structures in Graph Theory 54
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 90
- Graph Labeling and Dimension Problems 32
- Complexity and Algorithms in Graphs 16
- Geometry and Topology top 2%
- Graph theory and applications 12
-
- Complex Network Analysis Techniques 14
-
- graph theory and CDMA systems 36
-
- Interconnection Networks and Systems 14
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- United StatesChinaCanada
In The Last Decade
Cun‐Quan Zhang
125 papers receiving 1.4k citations
Peers
Comparison fields: 5 of 123
- Discrete Mathematics and Combinatorics 414
- Computational Theory and Mathematics 861
- Geometry and Topology 231
- Statistical and Nonlinear Physics 213
- Computer Graphics and Computer-Aided Design 58
Countries citing papers authored by Cun‐Quan Zhang
This map shows the geographic impact of Cun‐Quan Zhang'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 Cun‐Quan Zhang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Cun‐Quan Zhang more than expected).
Fields of papers citing papers by Cun‐Quan Zhang
This network shows the impact of papers produced by Cun‐Quan Zhang. 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 Cun‐Quan Zhang. The network helps show where Cun‐Quan Zhang may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Cun‐Quan Zhang, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2021 | 3 | |
| 2 | 2021 | 4 | |
| 3 | 2018 | 4 | |
| 4 | 2017 | 5 | |
| 5 | 2015 | 7 | |
| 6 | 2015 | 15 | |
| 7 | 2013 | 0 | |
| 8 | 2013 | 1 | |
| 9 | 2012 | 1 | |
| 10 | 2011 | 1 | |
| 11 | 2008 | 27 | |
| 12 | 2007 | 25 | |
| 13 | 2005 | 1 | |
| 14 | 2005 | 30 | |
| 15 | 2003 | 6 | |
| 16 | 2000 | 6 | |
| 17 | Permutation graphs and Petersen graph. | 1999 | 0 |
| 18 | 1998 | 5 | |
| 19 | 1996 | 4 | |
| 20 | 1994 | 2 |
About Cun‐Quan Zhang
Cun‐Quan Zhang is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Computer Graphics and Computer-Aided Design, having authored 139 papers that have together received 1.5k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (90 papers), Limits and Structures in Graph Theory (54 papers), graph theory and CDMA systems (36 papers), Graph Labeling and Dimension Problems (32 papers), Complexity and Algorithms in Graphs (16 papers), Complex Network Analysis Techniques (14 papers), Interconnection Networks and Systems (14 papers) and Graph theory and applications (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (414 citations), Computational Theory and Mathematics (861 citations) and Geometry and Topology (231 citations). Cun‐Quan Zhang has collaborated with scholars based in United States, China and Canada. Frequent co-authors include Yezhou Wu, Edgar Fuller, Xingqin Qi, Qin Wu, Rong Luo, Carsten Thomassen, Lei Wang, Jitian Han, Hongxia Zhao and Hong‐Jian Lai. Their work appears in journals such as Energy, BMC Bioinformatics and Information Sciences.
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.