Get started
Author

Pingshan Li

Observed name: Li, Pingshan
Institution: Xiangtan University
ORCID: 0000-0002-6331-0183
Observed ORCID: 0000-0002-6331-0183
OpenAlex ID: A5070114719
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge-connectivity of balanced hypercubes
2017 · Pingshan Li, Min Xu · Theoretical Computer Science · 53
PDF
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
2018 · Qi Cheng, Pingshan Li, et al. · Theoretical Computer Science · 37
The component (edge) connectivity of shuffle-cubes
2020 · Tongtong Ding, Pingshan Li, et al. · Theoretical Computer Science · 32
Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like networks
2019 · Pingshan Li, Min Xu · Discrete Applied Mathematics · 32
Edge-fault-tolerant edge-bipancyclicity of balanced hypercubes
2017 · Pingshan Li, Min Xu · Applied Mathematics and Computation · 24
PDF
The t/k-diagnosability and strong Menger connectivity on star graphs with conditional faults
2019 · Pingshan Li, Min Xu · Theoretical Computer Science · 21
PDF
Edge-fault-tolerant strong Menger edge connectivity on regular graphs
2020 · Min Xu, Pingshan Li · Theoretical Computer Science · 14
Component edge connectivity of hypercube-like networks
2022 · Dong Liu, Pingshan Li, et al. · Theoretical Computer Science · 13
Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees
2021 · Shudan Xue, Qingying Deng, et al. · The Computer Journal · 12
Fault-tolerant strong Menger (edge) connectivity of arrangement graph
2020 · Pingshan Li, Min Xu · Discrete Applied Mathematics · 12
Fault-Free Hamiltonian Cycles in Balanced Hypercubes with Conditional Edge Faults
2019 · Pingshan Li, Min Xu · International Journal of Foundations of Computer Science · 8
The largest component of faulty star graphs
2020 · Pingshan Li, Min Xu · Theoretical Computer Science · 7
The Super Spanning Connectivity of Arrangement Graphs
2017 · Pingshan Li, Min Xu · International Journal of Foundations of Computer Science · 7
Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
2023 · Shudan Xue, Qingying Deng, et al. · Discrete Applied Mathematics · 6
On Conditional Edge-Fault-Tolerant Strong Menger Edge Connectivity Of Folded Hypercubes
2023 · Shijie Zhao, Pingshan Li · The Computer Journal · 5
Edge fault-tolerance of strongly Menger edge connected graphs
2021 · Pingshan Li · Discrete Mathematics · 4
The maximum number of maximum generalized 4‐independent sets in trees
2024 · Pingshan Li, Min Xu · Journal of Graph Theory · 3
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
2021 · Pingshan Li, Rong Liu, et al. · International Journal of Foundations of Computer Science · 3
Structure connectivity and substructure connectivity of Möbius cubes
2024 · Xiaojun Zhao, Shudan Xue, et al. · The Computer Journal · 2
A note on the conditional fault-tolerant strong Menger edge connectivity of regular graphs
2024 · Pingshan Li, Min Xu, et al. · Discrete Applied Mathematics · 2
The 3-Good Neighbor Edge-Fault-Tolerant Strong Menger Edge Connectivity on the Class of BC Networks
2021 · Rong Liu, Pingshan Li · Journal of Interconnection Networks · 2
The cyclic diagnosability of Cayley graphs generated by transposition triangle-free unicyclic graphs under the PMC and MM∗ models
2026 · Jialu Ding, Caixia Li, et al. · Discrete Applied Mathematics
The characterization of the lower bound on the dissociation number of trees
2025 · Pingshan Li, Jue Wu, et al. · Discrete Mathematics
Paired 2-disjoint path cover of burnt pancake graphs with n − 3 faulty elements
2025 · Congzhen Chen, Pingshan Li, et al. · Discrete Applied Mathematics
Restricted 2-fault diameter of hypercubes
2025 · Pingshan Li, Wen Jiang, et al. · International Journal of Computer Mathematics Computer Systems Theory
Works count: 31
Citation count: 299
H-index: 10
I10-index: 10
Year
Topic
Type