default search action
Liqiong Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j43]Liqiong Xu:
Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks. Appl. Math. Comput. 473: 128673 (2024) - [j42]Zhecheng Yu, Liqiong Xu:
Reliability Evaluation Of Multiprocessor System Based On The Balanced Complete Multipartite Graphs. Comput. J. 67(2): 688-693 (2024) - [j41]Zhecheng Yu, Liqiong Xu, Xuemin Wu, Chuanye Zheng:
On the Super (Edge)-Connectivity of Generalized Johnson Graphs. Int. J. Found. Comput. Sci. 35(5): 579-593 (2024) - [j40]Liqiong Xu:
Uniformly 3-connected graphs. J. Graph Theory 105(3): 403-412 (2024) - [j39]Xuemin Wu, Liqiong Xu:
Fault-tolerance of enhanced hypercubes with faulty subcubes. Int. J. Parallel Emergent Distributed Syst. 39(1): 106-115 (2024) - [j38]Chuanye Zheng, Liqiong Xu:
Super (Edge-)connectivity of the Folded Petersen Network. Parallel Process. Lett. 34(2): 2450003:1-2450003:8 (2024) - [j37]Liqiong Xu, Shuming Zhou:
Reliability Assessment of Interconnection Networks Based on Link Fault Patterns. IEEE Trans. Reliab. 73(2): 1302-1309 (2024) - 2023
- [j36]Liqiong Xu:
Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes. Discret. Appl. Math. 324: 41-45 (2023) - [j35]Shanshan Yin, Liqiong Xu, Zhecheng Yu:
On the g-component connectivity of hypercube-like networks. Int. J. Parallel Emergent Distributed Syst. 38(2): 110-117 (2023) - [j34]Qifan Zhang, Liqiong Xu, Yuqing Lin:
4-Free Strong Digraphs with the Maximum Size. Parallel Process. Lett. 33(1&2): 2350004:1-2350004:16 (2023) - 2022
- [j33]Liqiong Xu, Litao Guo:
Analysis on the Component Connectivity of Enhanced Hypercubes. Comput. J. 65(4): 890-896 (2022) - [j32]Shanshan Yin, Liqiong Xu:
On the g-Extra Connectivity of the Enhanced Hypercubes. Comput. J. 65(9): 2339-2346 (2022) - [j31]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu:
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38(3): 72 (2022) - [j30]Shanshan Yin, Liqiong Xu, Weihua Yang:
The Sufficient Conditions of (δ(G) - 2)-(|F|-)Fault-Tolerant Maximal Local-(Edge-)Connectivity of Connected Graphs. J. Interconnect. Networks 22(1): 2142018:1-2142018:18 (2022) - [j29]Zhecheng Yu, Liqiong Xu, Shanshan Yin, Litao Guo:
Super Vertex (Edge)-Connectivity of Varietal Hypercube. Symmetry 14(2): 304 (2022) - [j28]Liqiong Xu, Shanshan Yin, Liyang Zhai:
Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model. Theor. Comput. Sci. 915: 45-54 (2022) - [j27]Liqiong Xu, Shuming Zhou:
An O(log2 N) algorithm for reliability assessment of augmented cubes based on h-extra edge-connectivity. J. Supercomput. 78(5): 6739-6751 (2022) - [j26]Shanshan Yin, Liqiong Xu:
Hybrid diagnosis of regular networks under the HPMC fault model. J. Supercomput. 78(15): 17247-17260 (2022) - [j25]Liqiong Xu, Shuming Zhou, Sun-Yuan Hsieh:
An $O(\log _3N)$ Algorithm for Reliability Assessment of 3-Ary $n$-Cubes Based on $h$-Extra Edge Connectivity. IEEE Trans. Reliab. 71(3): 1230-1240 (2022) - 2021
- [j24]Liqiong Xu, Shuming Zhou, Jiafei Liu, Shanshan Yin:
Reliability measure of multiprocessor system based on enhanced hypercubes. Discret. Appl. Math. 289: 125-138 (2021) - [j23]Litao Guo, Mingzu Zhang, Shaohui Zhai, Liqiong Xu:
Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks. Int. J. Found. Comput. Sci. 32(2): 137-149 (2021) - [j22]Qifan Zhang, Liqiong Xu, Weihua Yang:
Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity. J. Parallel Distributed Comput. 147: 124-131 (2021) - [j21]Liyang Zhai, Liqiong Xu, Shanshan Yin:
On the 3-Extra Connectivity of Enhanced Hypercubes. Parallel Process. Lett. 31(4): 2150016:1-2150016:15 (2021) - 2020
- [j20]Qifan Zhang, Liqiong Xu, Shuming Zhou, Litao Guo:
Reliability Analysis of Subsystem in Balanced Hypercubes. IEEE Access 8: 26478-26486 (2020) - [j19]Zuwen Luo, Liqiong Xu:
A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs. Comput. J. 63(9): 1372-1384 (2020) - [j18]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian:
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. Discret. Appl. Math. 285: 397-406 (2020) - [j17]Liqiong Xu, Yingzhi Tian, Hong-Jian Lai:
On the sizes of bi-k-maximal graphs. J. Comb. Optim. 39(3): 859-873 (2020) - [j16]Litao Guo, Chengfu Qin, Liqiong Xu:
Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes. J. Parallel Distributed Comput. 138: 190-198 (2020) - [j15]Liqiong Xu, Shuming Zhou, Weihua Yang:
Component connectivity of Cayley graphs generated by transposition trees. Int. J. Parallel Emergent Distributed Syst. 35(1): 103-110 (2020) - [j14]Qifan Zhang, Liqiong Xu, Weihua Yang, Shanshan Yin:
Reliability Analysis of the Generalized Exchanged Hypercube. Parallel Process. Lett. 30(2): 2050009:1-2050009:13 (2020) - [j13]Liyang Zhai, Liqiong Xu, Weihua Yang:
Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes. Parallel Process. Lett. 30(3): 2040001:1-2040001:13 (2020) - [j12]Qifan Zhang, Liqiong Xu, Shuming Zhou, Weihua Yang:
Reliability analysis of subsystem in dual cubes. Theor. Comput. Sci. 816: 249-259 (2020)
2010 – 2019
- 2019
- [j11]Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng:
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discret. Math. 342(2): 344-351 (2019) - [j10]Liqiong Xu, Xiaofeng Guo:
Contractible Edges and Removable Edges in 3-Connected Graphs. Graphs Comb. 35(6): 1375-1385 (2019) - [j9]Liqiong Xu, Shuming Zhou, Weihua Yang:
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions. Int. J. Found. Comput. Sci. 30(8): 1301-1315 (2019) - 2018
- [j8]Liqiong Xu, Shuming Zhou, Guanqin Lian, Zuwen Luo:
A Kind of Conditional Connectivity of Cayley Graphs Generated by 2-trees. Comput. J. 61(5): 714-721 (2018) - [j7]Liqiong Xu, Shuming Zhou, Guanqin Lian:
Conditional diagnosability of multiprocessor systems based on complete-transposition graphs. Discret. Appl. Math. 247: 367-379 (2018) - [j6]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu:
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341(4): 1120-1124 (2018) - [j5]Shuli Zhao, Weihua Yang, Shurong Zhang, Liqiong Xu:
Component Edge Connectivity of Hypercubes. Int. J. Found. Comput. Sci. 29(6): 995-1001 (2018) - 2017
- [j4]Liqiong Xu, Fuji Zhang:
On the incidence energy of graphs under three graph decorations. Ars Comb. 134: 267-281 (2017) - 2016
- [j3]Liqiong Xu, Xaohui Xu:
On Indidence Energy of Tree. Ars Comb. 126: 93-107 (2016)
2000 – 2009
- 2009
- [j2]Jianji Su, Xiaofeng Guo, Liqiong Xu:
Removable edges in a k-connected graph and a construction method for k-connected graphs. Discret. Math. 309(10): 3161-3165 (2009) - 2008
- [j1]Liqiong Xu, Xiaofeng Guo:
Removable edges in a 5-connected graph and a construction method of 5-connected graphs. Discret. Math. 308(9): 1726-1731 (2008)
Coauthor Index
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-10-07 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint