Mei-Mei Gu

707 total citations
38 papers, 485 citations indexed

About

Mei-Mei Gu is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Mei-Mei Gu has authored 38 papers receiving a total of 485 indexed citations (citations by other indexed papers that have themselves been cited), including 38 papers in Computer Networks and Communications, 19 papers in Computational Theory and Mathematics and 9 papers in Electrical and Electronic Engineering. Recurrent topics in Mei-Mei Gu's work include Interconnection Networks and Systems (37 papers), Advanced Graph Theory Research (18 papers) and Graph theory and applications (8 papers). Mei-Mei Gu is often cited by papers focused on Interconnection Networks and Systems (37 papers), Advanced Graph Theory Research (18 papers) and Graph theory and applications (8 papers). Mei-Mei Gu collaborates with scholars based in China, Taiwan and Czechia. Mei-Mei Gu's co-authors include Rong‐Xia Hao, Jou–Ming Chang, Yan‐Quan Feng, Shuming Zhou, Jianbing Liu, Shyue-Ming Tang, Xiao-Wang Li, Xiangyang Xu, Eddie Cheng and Tomáš Dvořák and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Access and Applied Mathematics and Computation.

In The Last Decade

Mei-Mei Gu

37 papers receiving 480 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Mei-Mei Gu China 15 468 230 112 95 88 38 485
Nai-Wen Chang Taiwan 12 564 1.2× 262 1.1× 134 1.2× 104 1.1× 149 1.7× 16 591
Zhizhang Shen United States 13 454 1.0× 198 0.9× 158 1.4× 127 1.3× 91 1.0× 66 513
Shu-Li Zhao China 13 405 0.9× 174 0.8× 163 1.5× 70 0.7× 30 0.3× 21 412
Liqiong Xu China 11 256 0.5× 132 0.6× 75 0.7× 54 0.6× 31 0.4× 41 296
Jinn‐Shyong Yang Taiwan 17 625 1.3× 391 1.7× 265 2.4× 58 0.6× 49 0.6× 32 652
J. Fàbrega Spain 11 589 1.3× 214 0.9× 339 3.0× 194 2.0× 45 0.5× 26 671
Meijie Ma China 17 834 1.8× 503 2.2× 309 2.8× 74 0.8× 162 1.8× 45 856
Kung-Jui Pai Taiwan 12 367 0.8× 205 0.9× 104 0.9× 29 0.3× 24 0.3× 42 417
Shuming Zhou China 10 207 0.4× 91 0.4× 37 0.3× 44 0.5× 44 0.5× 44 250
Pao-Lien Lai Taiwan 10 596 1.3× 267 1.2× 150 1.3× 125 1.3× 265 3.0× 23 622

Countries citing papers authored by Mei-Mei Gu

Since Specialization
Citations

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

Fields of papers citing papers by Mei-Mei Gu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Mei-Mei Gu

This figure shows the co-authorship network connecting the top 25 collaborators of Mei-Mei Gu. A scholar is included among the top collaborators of Mei-Mei Gu 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 Mei-Mei Gu. Mei-Mei Gu 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.
Gu, Mei-Mei, Jinn‐Shyong Yang, & Jou–Ming Chang. (2024). Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion. IEEE Transactions on Network Science and Engineering. 11(5). 4384–4396. 4 indexed citations
2.
Gu, Mei-Mei, Hongxia Yan, & Jou–Ming Chang. (2024). A Validation of the Phenomenon of Linearly Many Faults on Burnt Pancake Graphs with Its Applications. Mathematics. 12(2). 268–268. 1 indexed citations
3.
Gu, Mei-Mei, Kung-Jui Pai, & Jou–Ming Chang. (2022). Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. Journal of Parallel and Distributed Computing. 171. 54–65. 8 indexed citations
4.
Gu, Mei-Mei & Jou–Ming Chang. (2022). Neighbor connectivity of pancake graphs and burnt pancake graphs. Discrete Applied Mathematics. 324. 46–57. 9 indexed citations
5.
Gu, Mei-Mei, Jou–Ming Chang, & Rong‐Xia Hao. (2020). Strong Menger Connectedness of Augmented k-ary n-cubes. The Computer Journal. 64(5). 812–825. 15 indexed citations
6.
Gu, Mei-Mei, Rong‐Xia Hao, & Eddie Cheng. (2020). Fault diagnosability of regular graphs. SHILAP Revista de lepidopterología. 7(2). 1–16. 3 indexed citations
7.
Gu, Mei-Mei, Rong‐Xia Hao, & Shuming Zhou. (2019). Fault diagnosability of data center networks. Theoretical Computer Science. 776. 138–147. 22 indexed citations
8.
Gu, Mei-Mei, Rong‐Xia Hao, & Eddie Cheng. (2019). Note on Applications of Linearly Many Faults. The Computer Journal. 63(9). 1406–1416. 6 indexed citations
9.
Gu, Mei-Mei, Rong‐Xia Hao, & Jou–Ming Chang. (2019). Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity. IEEE Access. 7. 97745–97759. 18 indexed citations
10.
Gu, Mei-Mei, et al.. (2019). Strongly Menger connectedness of data center network and (n,k)-star graph. Theoretical Computer Science. 799. 94–103. 20 indexed citations
11.
Gu, Mei-Mei & Rong‐Xia Hao. (2018). Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.. Ars Combinatoria. 140. 45–61. 1 indexed citations
12.
Gu, Mei-Mei & Rong‐Xia Hao. (2018). Reliability analysis of Cayley graphs generated by transpositions. Discrete Applied Mathematics. 244. 94–102. 11 indexed citations
13.
Gu, Mei-Mei, Rong‐Xia Hao, Jun‐Ming Xu, & Yan‐Quan Feng. (2017). Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. Theoretical Computer Science. 690. 59–72. 14 indexed citations
14.
Gu, Mei-Mei & Rong‐Xia Hao. (2016). The pessimistic diagnosability of three kinds of graphs. Discrete Applied Mathematics. 217. 548–556. 13 indexed citations
15.
Xu, Xiangyang, Xiao-Wang Li, Shuming Zhou, Rong‐Xia Hao, & Mei-Mei Gu. (2016). The g-good-neighbor diagnosability of (n,k)-star graphs. Theoretical Computer Science. 659. 53–63. 41 indexed citations
16.
Hao, Rong‐Xia, et al.. (2016). A Note on the Pessimistic Diagnosability of Augmented Cubes. Journal of Interconnection Networks. 16(03n04). 1671001–1671001. 2 indexed citations
17.
Gu, Mei-Mei, et al.. (2016). Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges. Theoretical Computer Science. 627. 82–89. 1 indexed citations
18.
Hao, Rong‐Xia, Mei-Mei Gu, & Yan‐Quan Feng. (2015). The pessimistic diagnosabilities of some general regular graphs. Theoretical Computer Science. 609. 413–420. 17 indexed citations
19.
Gu, Mei-Mei, Rong‐Xia Hao, & Jianbing Liu. (2015). On the extraconnectivity ofk-aryn-cube networks. International Journal of Computer Mathematics. 94(1). 95–106. 17 indexed citations
20.
Gu, Mei-Mei & Rong‐Xia Hao. (2014). 3-extra connectivity of 3-ary n-cube networks. Information Processing Letters. 114(9). 486–491. 44 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