Liying Kang
- Computational Mathematics top 1%
-
- Limits and Structures in Graph Theory 36
- Computational Theory and Mathematics top 0.5%
- Advanced Graph Theory Research 72
- Graph Labeling and Dimension Problems 35
- Complexity and Algorithms in Graphs 26
-
- Scheduling and Optimization Algorithms 15
- Geometry and Topology top 2%
- Graph theory and applications 33
-
- Interconnection Networks and Systems 14
- Optimization and Search Problems 13
- Co-authors
- Erfang ShanT.C.E. ChengC.T. NgMin ZhaoGerard J. ChangNa YinHong QiaoJinjiang Yuan
- Cited by
- Computational MathematicsDiscrete Mathematics and CombinatoricsComputational Theory and Mathematics
- Journals
- Discrete Mathematics (19 papers)Discrete Applied Mathematics (11 papers)Theoretical Computer Science (10 papers)
- Partner nations
- ChinaHong KongUnited States
In The Last Decade
Liying Kang
108 papers receiving 1.0k citations
Peers
Comparison fields: 5 of 73
- Computational Mathematics 87
- Discrete Mathematics and Combinatorics 163
- Computational Theory and Mathematics 630
- Industrial and Manufacturing Engineering 303
- Geometry and Topology 256
Countries citing papers authored by Liying Kang
This map shows the geographic impact of Liying Kang'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 Liying Kang with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Liying Kang more than expected).
Fields of papers citing papers by Liying Kang
This network shows the impact of papers produced by Liying Kang. 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 Liying Kang. The network helps show where Liying Kang may publish in the future.
Co-authorship network
The 25 scholars most cited alongside Liying Kang, 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 | 2023 | 9 | |
| 2 | 2019 | 5 | |
| 3 | 2018 | 5 | |
| 4 | 2017 | 15 | |
| 5 | 2015 | 12 | |
| 6 | 2015 | 2 | |
| 7 | 2015 | 3 | |
| 8 | 2013 | 14 | |
| 9 | Bondage number in oriented graphs. | 2007 | 2 |
| 10 | 2007 | 8 | |
| 11 | 2007 | 5 | |
| 12 | 2007 | 6 | |
| 13 | 2006 | 5 | |
| 14 | 2006 | 60 | |
| 15 | A characterization of trees with equal total domination and paired-domination numbers. | 2004 | 21 |
| 16 | 2004 | 2 | |
| 17 | Upper bounds on signed 2-independence number of graphs. | 2003 | 6 |
| 18 | 2003 | 13 | |
| 19 | Lower bounds on dominating functions in graphs. | 2000 | 9 |
| 20 | 2000 | 30 |
About Liying Kang
Liying Kang is a scholar working on Computational Mathematics, Discrete Mathematics and Combinatorics and Computational Theory and Mathematics, having authored 119 papers that have together received 1.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (72 papers), Limits and Structures in Graph Theory (36 papers), Graph Labeling and Dimension Problems (35 papers), Graph theory and applications (33 papers), Complexity and Algorithms in Graphs (26 papers), Scheduling and Optimization Algorithms (15 papers), Interconnection Networks and Systems (14 papers) and Optimization and Search Problems (13 papers). The work is most often cited by research in Computational Mathematics (87 citations), Discrete Mathematics and Combinatorics (163 citations) and Computational Theory and Mathematics (630 citations). Liying Kang has collaborated with scholars based in China, Hong Kong and United States. Frequent co-authors include Erfang Shan, T.C.E. Cheng, C.T. Ng, Min Zhao, Gerard J. Chang, Na Yin, Hong Qiao, Jinjiang Yuan, Xiying Yuan and Jing Wang. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Theoretical Computer Science, Graphs and Combinatorics and Journal of Combinatorial Optimization.
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.