default search action
Mei-Mei Gu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Tomás Dvorák
, Mei-Mei Gu
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. Theor. Comput. Sci. 986: 114327 (2024) - [j34]Mei-Mei Gu
Assessing Network Reliability Through Perspectives of Neighbor Connectivity and Subversion. IEEE Trans. Netw. Sci. Eng. 11(5): 4384-4396 (2024) - 2023
- [j33]Mei-Mei Gu
Neighbor connectivity of pancake graphs and burnt pancake graphs. Discret. Appl. Math. 324: 46-57 (2023) - [j32]Mei-Mei Gu
Subversion analyses of hierarchical networks based on (edge) neighbor connectivity. J. Parallel Distributed Comput. 171: 54-65 (2023) - [i6]Tomás Dvorák, Mei-Mei Gu:
Paired 2-disjoint path covers of burnt pancake graphs with faulty elements. CoRR abs/2310.18831 (2023) - 2021
- [j31]Mei-Mei Gu
Strong Menger Connectedness of Augmented k-ary n-cubes. Comput. J. 64(5): 812-825 (2021) - [j30]Mei-Mei Gu
Reliability Analysis of Alternating Group Graphs and Split-Stars. Comput. J. 64(9): 1425-1436 (2021) - [j29]Mei-Mei Gu
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions. Discret. Appl. Math. 304: 137-152 (2021) - [j28]Mei-Mei Gu
A Note on Super Connectivity of the Bouwer Graph. J. Interconnect. Networks 21(4): 2142009:1-2142009:8 (2021) - 2020
- [j27]Tomás Dvorák
Neighbor connectivity of k-ary n-cubes. Appl. Math. Comput. 379: 125237 (2020) - [j26]Mei-Mei Gu
On Computing Component (Edge) Connectivities of Balanced Hypercubes. Comput. J. 63(9): 1311-1320 (2020) - [j25]Mei-Mei Gu
Note on Applications of Linearly Many Faults. Comput. J. 63(9): 1406-1416 (2020) - [j24]Mei-Mei Gu
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs. Discret. Appl. Math. 279: 80-91 (2020) - [j23]Mei-Mei Gu
On Component Connectivity of Hierarchical Star Networks. Int. J. Found. Comput. Sci. 31(3): 313-326 (2020) - [j22]Rong-Xia Hao, Mei-Mei Gu
Relationship between extra edge connectivity and component edge connectivity for regular graphs. Theor. Comput. Sci. 833: 41-55 (2020)
2010 – 2019
- 2019
- [j21]Mei-Mei Gu
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity. IEEE Access 7: 97745-97759 (2019) - [j20]Mei-Mei Gu
Fault diagnosability of data center networks. Theor. Comput. Sci. 776: 138-147 (2019) - [j19]Mei-Mei Gu
Strongly Menger connectedness of data center network and (n, k)-star graph. Theor. Comput. Sci. 799: 94-103 (2019) - [i5]Mei-Mei Gu, Jou-Ming Chang, Rong-Xia Hao:
Strong Menger connectedness of augmented k-ary n-cubes. CoRR abs/1910.00852 (2019) - [i4]Tomás Dvorák
Neighbor connectivity of k-ary n-cubes. CoRR abs/1910.12364 (2019) - 2018
- [j18]Mei-Mei Gu, Rong-Xia Hao:
Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges. Ars Comb. 140: 45-61 (2018) - [j17]Mei-Mei Gu
The 3-extra Connectivity and Faulty Diagnosability. Comput. J. 61(5): 672-686 (2018) - [j16]Mei-Mei Gu
Reliability analysis of Cayley graphs generated by transpositions. Discret. Appl. Math. 244: 94-102 (2018) - [j15]Mei-Mei Gu
Fault-tolerance and diagnosability of hierarchical star networks. Int. J. Comput. Math. Comput. Syst. Theory 3(2): 106-121 (2018) - [j14]Mei-Mei Gu
The pessimistic diagnosability of data center networks. Inf. Process. Lett. 134: 52-56 (2018) - [i3]Mei-Mei Gu, Rong-Xia Hao, Jou-Ming Chang:
The Component Connectivity of Alternating Group Graphs and Split-Stars. CoRR abs/1812.00617 (2018) - 2017
- [j13]Mei-Mei Gu
The pessimistic diagnosability of three kinds of graphs. Discret. Appl. Math. 217: 548-556 (2017) - [j12]Mei-Mei Gu
On the extraconnectivity of k-ary n-cube networks. Int. J. Comput. Math. 94(1): 95-106 (2017) - [j11]Mei-Mei Gu
The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs. J. Interconnect. Networks 17(3-4): 1741001:1-1741001:13 (2017) - [j10]Xiang Xu, Xiaowang Li, Shuming Zhou, Rong-Xia Hao
The g-good-neighbor diagnosability of (n, k)-star graphs. Theor. Comput. Sci. 659: 53-63 (2017) - [j9]Mei-Mei Gu
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. Theor. Comput. Sci. 690: 59-72 (2017) - [i2]Mei-Mei Gu, Rong-Xia Hao, Shuming Zhou:
Fault diagnosability of data center networks. CoRR abs/1702.00259 (2017) - 2016
- [j8]Mei-Mei Gu
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes. Int. J. Comput. Math. Comput. Syst. Theory 1(3-4): 98-112 (2016) - [j7]Mei-Mei Gu
A Short Note on the 1, 2-Good-Neighbor Diagnosability of Balanced Hypercubes. J. Interconnect. Networks 16(2): 1650001:1-1650001:12 (2016) - [j6]Mei-Mei Gu
Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes. J. Interconnect. Networks 16(2): 1650002:1-1650002:17 (2016) - [j5]Rong-Xia Hao, Mei-Mei Gu
A Note on the Pessimistic Diagnosability of Augmented Cubes. J. Interconnect. Networks 16(3-4): 1671001:1-1671001:8 (2016) - [j4]Rong-Xia Hao, Mei-Mei Gu
The pessimistic diagnosabilities of some general regular graphs. Theor. Comput. Sci. 609: 413-420 (2016) - [j3]Da-Wei Yang, Mei-Mei Gu
Conditional fault-tolerant edge-bipancyclicity of hypercubes with faulty vertices and edges. Theor. Comput. Sci. 627: 82-89 (2016) - 2015
- [j2]Mei-Mei Gu
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges. J. Interconnect. Networks 15(1-2): 1550002:1-1550002:16 (2015) - 2014
- [j1]Mei-Mei Gu
3-extra connectivity of 3-ary n-cube networks. Inf. Process. Lett. 114(9): 486-491 (2014) - 2013
- [i1]Mei-Mei Gu, Rong-Xia Hao:
3-extra connectivity of 3-ary n-cube networks. CoRR abs/1309.5083 (2013)
Coauthor Index
aka: Rong-Xia Hao
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: