Liying Kang

1.7k total citations
119 papers, 1.1k citations indexed

About

Liying Kang is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Liying Kang has authored 119 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 85 papers in Computational Theory and Mathematics, 36 papers in Discrete Mathematics and Combinatorics and 34 papers in Geometry and Topology. Recurrent topics in Liying Kang's work include Advanced Graph Theory Research (72 papers), Limits and Structures in Graph Theory (36 papers) and Graph Labeling and Dimension Problems (35 papers). Liying Kang is often cited by papers focused on Advanced Graph Theory Research (72 papers), Limits and Structures in Graph Theory (36 papers) and Graph Labeling and Dimension Problems (35 papers). Liying Kang collaborates with scholars based in China, Hong Kong and United States. Liying Kang's 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 and has published in prestigious journals such as European Journal of Operational Research, International Journal of Production Economics and Information Sciences.

In The Last Decade

Liying Kang

108 papers receiving 1.0k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Liying Kang China 17 630 333 303 256 163 119 1.1k
Erfang Shan China 12 428 0.7× 137 0.4× 22 0.1× 116 0.5× 86 0.5× 114 544
Ján Plesnı́k Slovakia 14 452 0.7× 258 0.8× 55 0.2× 268 1.0× 136 0.8× 37 701
Bohdan Zelinka Czechia 15 638 1.0× 108 0.3× 23 0.1× 241 0.9× 146 0.9× 199 829
Mustapha Chellali Algeria 21 1.2k 1.9× 356 1.1× 12 0.0× 201 0.8× 215 1.3× 135 1.4k
Clive Elphick United Kingdom 10 214 0.3× 31 0.1× 47 0.2× 164 0.6× 47 0.3× 28 418
Stefan Kratsch Germany 15 553 0.9× 188 0.6× 61 0.2× 15 0.1× 84 0.5× 56 672
David P. Jacobs United States 16 304 0.5× 230 0.7× 22 0.1× 201 0.8× 47 0.3× 55 564
Vladimir Gurvich United States 12 255 0.4× 67 0.2× 10 0.0× 98 0.4× 80 0.5× 61 453
Frédéric Maffray France 16 1.0k 1.6× 162 0.5× 17 0.1× 186 0.7× 480 2.9× 111 1.1k
Petr A. Golovach Norway 17 922 1.5× 296 0.9× 33 0.1× 88 0.3× 277 1.7× 149 1.0k

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
1.
Kang, Liying, et al.. (2023). Spectral Extremal Graphs for Disjoint Cliques. The Electronic Journal of Combinatorics. 30(1). 9 indexed citations
2.
Kang, Liying, et al.. (2019). Bounds on the spectral radius of uniform hypergraphs. Discrete Applied Mathematics. 259. 160–169. 5 indexed citations
3.
Shan, Erfang, et al.. (2018). Domination in intersecting hypergraphs. Discrete Applied Mathematics. 251. 155–159. 5 indexed citations
4.
Xue, Yucong, Huiran Zhang, Yuanyuan Zhang, et al.. (2017). Characterization and structure-activity relationship of natural flavonoids as hERG K + channel modulators. International Immunopharmacology. 45. 187–193. 15 indexed citations
5.
Kang, Liying, et al.. (2015). The p-spectral radius of k-partite and k-chromatic uniform hypergraphs. Linear Algebra and its Applications. 478. 81–107. 12 indexed citations
6.
Shan, Erfang & Liying Kang. (2015). Coloring clique-hypergraphs of graphs with no subdivision ofK5. Theoretical Computer Science. 592. 166–175. 2 indexed citations
7.
Shan, Erfang, et al.. (2015). Constructing the minimum dominating sets of generalized de Bruijn digraphs. Discrete Mathematics. 338(8). 1501–1508. 3 indexed citations
8.
Shan, Erfang, et al.. (2013). Clique-transversal sets and clique-coloring in planar graphs. European Journal of Combinatorics. 36. 367–376. 14 indexed citations
9.
Shan, Erfang & Liying Kang. (2007). Bondage number in oriented graphs.. Ars Combinatoria. 84. 2 indexed citations
10.
Kang, Liying, et al.. (2007). An approximation algorithm for parallel machine scheduling with simple linear deterioration. Journal of Shanghai University (English Edition). 11(4). 351–354. 8 indexed citations
11.
Kang, Liying & Erfang Shan. (2007). Dominating functions with integer values in graphs—a survey. Journal of Shanghai University (English Edition). 11(5). 437–448. 5 indexed citations
12.
Kang, Liying, et al.. (2007). Proof of a conjecture on k-tuple domination in graphs. Applied Mathematics Letters. 21(3). 287–290. 6 indexed citations
13.
Kang, Liying & Erfang Shan. (2006). Signed total domination in nearly regular graphs. Journal of Shanghai University (English Edition). 10(1). 4–8. 5 indexed citations
14.
Zhao, Min, Liying Kang, & Gerard J. Chang. (2006). Power domination in graphs. Discrete Mathematics. 306(15). 1812–1816. 60 indexed citations
15.
Shan, Erfang, Liying Kang, & Michael A. Henning. (2004). A characterization of trees with equal total domination and paired-domination numbers.. Australas. J Comb.. 30. 31–40. 21 indexed citations
16.
Shan, Erfang & Liying Kang. (2004). A note on balance vertices in trees. Discrete Mathematics. 280(1-3). 265–269. 2 indexed citations
17.
Shan, Erfang, et al.. (2003). Upper bounds on signed 2-independence number of graphs.. Ars Combinatoria. 69(12). 1379–82. 6 indexed citations
18.
Kang, Liying, Hong Qiao, Erfang Shan, & Ding‐Zhu Du. (2003). Lower bounds on the minus domination and k-subdomination numbers. Theoretical Computer Science. 296(1). 89–98. 13 indexed citations
19.
Kang, Liying & Erfang Shan. (2000). Lower bounds on dominating functions in graphs.. Ars Combinatoria. 56. 9 indexed citations
20.
Kang, Liying & Jinjiang Yuan. (2000). Bondage number of planar graphs. Discrete Mathematics. 222(1-3). 191–198. 30 indexed citations

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