Liying Kang

108 papers receiving 1.0k citations

Peers

Liying Kang
Comparison fields: 5 of 73
  • Computational Theory and Mathematics 630
  • Computer Networks and Communications 333
  • Industrial and Manufacturing Engineering 303
  • Geometry and Topology 256
  • Discrete Mathematics and Combinatorics 163
Replace Erfang Shan with:
Erfang Shan China
Stefan Kratsch Germany
Ján Plesnı́k Slovakia
Clive Elphick United Kingdom
Bohdan Zelinka Czechia
Frédéric Maffray France
Vladimir Gurvich United States
Petr A. Golovach Norway
Daniël Paulusma United Kingdom
Mustapha Chellali Algeria
Liying Kang relative to Erfang Shan China Erfang Shan's profile →
Citations per field
00.5×10×13.8×
Erfang Shan · 1×
Citations per year

Countries citing papers authored by Liying Kang

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Liying Kang

This figure shows the co-authorship network connecting the top 25 collaborators of Liying Kang. A scholar is included among the top collaborators of Liying Kang 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 Liying Kang. Liying Kang is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 9
2 5
3 5
4 15
5 12
6 2
7 3
8 14
9
Bondage number in oriented graphs.
2
10 8
11 5
12 6
13 5
14 60
15
A characterization of trees with equal total domination and paired-domination numbers.
21
16 2
17
Upper bounds on signed 2-independence number of graphs.
6
18 13
19
Lower bounds on dominating functions in graphs.
9
20 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) and Graph Labeling and Dimension Problems (35 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 European Journal of Operational Research, International Journal of Production Economics 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026