Liqiong Xu

Orcid: 0000-0003-2060-9289

According to our database1, Liqiong Xu authored at least 39 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Uniformly 3-connected graphs.
J. Graph Theory, March, 2024

Reliability Evaluation Of Multiprocessor System Based On The Balanced Complete Multipartite Graphs.
Comput. J., February, 2024

Fault-tolerance of enhanced hypercubes with faulty subcubes.
Int. J. Parallel Emergent Distributed Syst., January, 2024

2023
4-Free Strong Digraphs with the Maximum Size.
Parallel Process. Lett., 2023

On the <i>g</i>-component connectivity of hypercube-like networks.
Int. J. Parallel Emergent Distributed Syst., 2023

Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes.
Discret. Appl. Math., 2023

2022
An $O(\log _3N)$ Algorithm for Reliability Assessment of 3-Ary $n$-Cubes Based on $h$-Extra Edge Connectivity.
IEEE Trans. Reliab., 2022

Hybrid diagnosis of regular networks under the HPMC fault model.
J. Supercomput., 2022

An O(log<sub>2</sub> N) algorithm for reliability assessment of augmented cubes based on h-extra edge-connectivity.
J. Supercomput., 2022

Diagnosability and hybrid diagnosability of some classes of graphs under the BPMC model.
Theor. Comput. Sci., 2022

Super Vertex (Edge)-Connectivity of Varietal Hypercube.
Symmetry, 2022

The Sufficient Conditions of (δ(G) - 2)-(|F|-)Fault-Tolerant Maximal Local-(Edge-)Connectivity of Connected Graphs.
J. Interconnect. Networks, 2022

The Extremal Sizes of Arc-Maximal (k, l)-Digraphs.
Graphs Comb., 2022

On the <i>g</i>-Extra Connectivity of the Enhanced Hypercubes.
Comput. J., 2022

Analysis on the Component Connectivity of Enhanced Hypercubes.
Comput. J., 2022

2021
On the 3-Extra Connectivity of Enhanced Hypercubes.
Parallel Process. Lett., 2021

Reliability analysis of the augmented cubes in terms of the extra edge-connectivity and the component edge-connectivity.
J. Parallel Distributed Comput., 2021

Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks.
Int. J. Found. Comput. Sci., 2021

Reliability measure of multiprocessor system based on enhanced hypercubes.
Discret. Appl. Math., 2021

2020
Reliability analysis of subsystem in dual cubes.
Theor. Comput. Sci., 2020

Reliability Analysis of the Generalized Exchanged Hypercube.
Parallel Process. Lett., 2020

Fault-Tolerant Maximal Local-Edge-Connectivity of Augmented Cubes.
Parallel Process. Lett., 2020

Component connectivity of Cayley graphs generated by transposition trees.
Int. J. Parallel Emergent Distributed Syst., 2020

Subgraph fault tolerance of distance optimally edge connected hypercubes and folded hypercubes.
J. Parallel Distributed Comput., 2020

On the sizes of bi-k-maximal graphs.
J. Comb. Optim., 2020

On the extremal sizes of maximal graphs without (k+1)-connected subgraphs.
Discret. Appl. Math., 2020

A Kind Of Conditional Vertex Connectivity Of Cayley Graphs Generated By Wheel Graphs.
Comput. J., 2020

Reliability Analysis of Subsystem in Balanced Hypercubes.
IEEE Access, 2020

2019
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions.
Int. J. Found. Comput. Sci., 2019

Contractible Edges and Removable Edges in 3-Connected Graphs.
Graphs Comb., 2019

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.
Discret. Math., 2019

2018
Component Edge Connectivity of Hypercubes.
Int. J. Found. Comput. Sci., 2018

Connectivity keeping stars or double-stars in 2-connected graphs.
Discret. Math., 2018

Conditional diagnosability of multiprocessor systems based on complete-transposition graphs.
Discret. Appl. Math., 2018

A Kind of Conditional Connectivity of Cayley Graphs Generated by 2-trees.
Comput. J., 2018

2017
On the incidence energy of graphs under three graph decorations.
Ars Comb., 2017

2016
On Indidence Energy of Tree.
Ars Comb., 2016

2009
Removable edges in a k-connected graph and a construction method for k-connected graphs.
Discret. Math., 2009

2008
Removable edges in a 5-connected graph and a construction method of 5-connected graphs.
Discret. Math., 2008


  Loading...