Yaping Mao

1.4k total citations
102 papers, 673 citations indexed

About

Yaping Mao is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Yaping Mao has authored 102 papers receiving a total of 673 indexed citations (citations by other indexed papers that have themselves been cited), including 82 papers in Computational Theory and Mathematics, 57 papers in Geometry and Topology and 45 papers in Computer Networks and Communications. Recurrent topics in Yaping Mao's work include Advanced Graph Theory Research (66 papers), Interconnection Networks and Systems (43 papers) and Graph theory and applications (41 papers). Yaping Mao is often cited by papers focused on Advanced Graph Theory Research (66 papers), Interconnection Networks and Systems (43 papers) and Graph theory and applications (41 papers). Yaping Mao collaborates with scholars based in China, United States and France. Yaping Mao's co-authors include Xueliang Li, İvan Gutman, Yuefang Sun, Eddie Cheng, Boris Furtula, Zhao Wang, Zhao Wang, Xueliang Li, Zhao Wang and Hengzhe Li and has published in prestigious journals such as SHILAP Revista de lepidopterología, BMC Bioinformatics and Applied Mathematics and Computation.

In The Last Decade

Yaping Mao

81 papers receiving 644 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Yaping Mao China	13	497	352	313	93	69	102	673
Jianhua Tu China	14	438 0.9×	225 0.6×	191 0.6×	67 0.7×	150 2.2×	52	550
Huiqing Liu China	16	496 1.0×	219 0.6×	551 1.8×	70 0.8×	116 1.7×	69	757
Indra Rajasingh India	12	371 0.7×	159 0.5×	244 0.8×	126 1.4×	14 0.2×	50	488
L. Sunil Chandran India	16	574 1.2×	146 0.4×	147 0.5×	103 1.1×	253 3.7×	88	746
Xiang-Feng Pan China	16	586 1.2×	132 0.4×	644 2.1×	90 1.0×	18 0.3×	62	895
Richard H. Hammack United States	7	500 1.0×	164 0.5×	267 0.9×	155 1.7×	174 2.5×	36	721
Bharati Rajan Kuwait	15	412 0.8×	281 0.8×	192 0.6×	253 2.7×	7 0.1×	38	578
Peter Dankelmann South Africa	19	837 1.7×	354 1.0×	705 2.3×	91 1.0×	133 1.9×	95	1.0k
Irene Sciriha Malta	14	360 0.7×	38 0.1×	478 1.5×	160 1.7×	133 1.9×	54	598
Domingos M. Cardoso Portugal	14	470 0.9×	96 0.3×	494 1.6×	74 0.8×	172 2.5×	70	763

Countries citing papers authored by Yaping Mao

Since Specialization

Citations

This map shows the geographic impact of Yaping Mao'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 Yaping Mao with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yaping Mao more than expected).

Fields of papers citing papers by Yaping Mao

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Yaping Mao. 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 Yaping Mao. The network helps show where Yaping Mao may publish in the future.

Co-authorship network of co-authors of Yaping Mao

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Ji, Zhen, Zhiwei Guo, Eddie Cheng, Ralf Klasing, & Yaping Mao. (2025). The distance-edge-monitoring numbers of subdivision graphs. Discrete Applied Mathematics. 372. 37–47.

Mao, Yaping. (2025). Ordered Gallai–Ramsey numbers. Discrete Applied Mathematics. 376. 62–71.

Zhang, Xiaojuan, et al.. (2024). The number of spanning trees for Sierpiński graphs and data center networks. Information and Computation. 300. 105194–105194.

Li, Wen, Ralf Klasing, Yaping Mao, & Bo Ning. (2024). Monitoring the edges of product networks using distances. Journal of Computer and System Sciences. 148. 103602–103602. 1 indexed citations

Yang, Gang, et al.. (2024). Monitoring the edges of a graph using distances with given girth. Journal of Computer and System Sciences. 143. 103528–103528. 4 indexed citations

Li, Ping, et al.. (2024). Gallai–Ramsey Numbers for Paths. Graphs and Combinatorics. 40(6).

Chen, Weizhen, et al.. (2023). Complete bipartite graphs without small rainbow stars. Discrete Applied Mathematics. 340. 14–20. 1 indexed citations

Mao, Yaping. (2023). Size Gallai–Ramsey Number. Graphs and Combinatorics. 39(6). 2 indexed citations

Wang, Zhao, et al.. (2023). Gallai–Ramsey Numbers Involving a Rainbow 4-Path. Graphs and Combinatorics. 39(3). 4 indexed citations

10.

He, Changxiang, et al.. (2022). Gallai-Ramsey numbers for rainbow P5 and monochromatic fans or wheels. Discrete Mathematics. 345(11). 113092–113092. 2 indexed citations

11.

Mao, Yaping, et al.. (2020). Ramsey and Gallai–Ramsey numbers for stars with extra independent edges. Discrete Applied Mathematics. 285. 153–172. 3 indexed citations

12.

Wang, Zhao, Yaping Mao, Kinkar Chandra Das, & Yilun Shang. (2020). Nordhaus–Gaddum-Type Results for the Steiner Gutman Index of Graphs. Symmetry. 12(10). 1711–1711. 7 indexed citations

13.

Wang, Zhao, et al.. (2020). Ramsey and Gallai-Ramsey Numbers for Two Classes of Unicyclic Graphs. Graphs and Combinatorics. 37(1). 337–354. 6 indexed citations

14.

Ma, Tianlong, et al.. (2019). Fractional matching preclusion for generalized augmented cubes. Discrete Mathematics & Theoretical Computer Science. vol. 21 no. 4(Distributed Computing and...). 2 indexed citations

15.

Wang, Zhao, et al.. (2019). Steiner Distance in Join, Corona, Cluster, and Threshold Graphs.. Journal of information science and engineering. 35. 721–735. 2 indexed citations

16.

Wang, Zhao, et al.. (2019). Matching preclusion number of graphs. Theoretical Computer Science. 759. 61–71. 9 indexed citations

17.

Mao, Yaping, Eddie Cheng, & Zhao Wang. (2018). Steiner Distance in Product Networks. SHILAP Revista de lepidopterología. 5 indexed citations

18.

Li, Xueliang, et al.. (2018). On conflict-free connection of graphs. Discrete Applied Mathematics. 255. 167–182. 10 indexed citations

19.

Zhao, Haixing, et al.. (2015). Trees with large numbers of subtrees. International Journal of Computer Mathematics. 94(2). 372–385. 12 indexed citations

20.

Li, Xueliang & Yaping Mao. (2014). The generalized 3-connectivity of Lexicographic product graphs. Discrete Mathematics & Theoretical Computer Science. Vol. 16 no. 1(Graph Theory). 6 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