Rongxia Hao
This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.
Bibliography
2025
Appl. Math. Comput., 2025
2024
J. Supercomput., July, 2024
Discret. Appl. Math., 2024
Appl. Math. Comput., 2024
2023
Appl. Math. Comput., November, 2023
Discret. Appl. Math., October, 2023
J. Interconnect. Networks, September, 2023
SIAM J. Discret. Math., March, 2023
IEEE Trans. Parallel Distributed Syst., 2023
Discret. Math., 2023
2022
IEEE Trans. Parallel Distributed Syst., 2022
Discret. Appl. Math., 2022
Internally disjoint trees in the line graph and total graph of the complete bipartite graph.
Appl. Math. Comput., 2022
Proceedings of the New Trends in Computer Technologies and Applications, 2022
2021
Packing internally disjoint Steiner trees to compute the <i>κ</i><sub>3</sub>-connectivity in augmented cubes.
J. Parallel Distributed Comput., 2021
J. Graph Theory, 2021
Eur. J. Comb., 2021
Discret. Appl. Math., 2021
The reliability analysis based on the generalized connectivity in balanced hypercubes.
Discret. Appl. Math., 2021
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions.
Discret. Appl. Math., 2021
Appl. Math. Comput., 2021
Appl. Math. Comput., 2021
2020
IEEE Trans. Parallel Distributed Syst., 2020
Relationship between extra edge connectivity and component edge connectivity for regular graphs.
Theor. Comput. Sci., 2020
Int. J. Found. Comput. Sci., 2020
Discret. Appl. Math., 2020
Comments on "A Hamilton sufficient condition for completely independent spanning tree".
Discret. Appl. Math., 2020
Discret. Appl. Math., 2020
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs.
Discret. Appl. Math., 2020
Comput. J., 2020
Appl. Math. Comput., 2020
2019
Strongly Menger connectedness of data center network and (<i>n</i>, <i>k</i>)-star graph.
Theor. Comput. Sci., 2019
J. Parallel Distributed Comput., 2019
Inf. Process. Lett., 2019
Int. J. Found. Comput. Sci., 2019
Independence number, connectivity and all fractional (<i>a, b, k</i>)-critical graphs.
Discuss. Math. Graph Theory, 2019
Discret. Math., 2019
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity.
IEEE Access, 2019
Proceedings of the From Parallel to Emergent Computing, 1st Edition, 2019
2018
Strongly Menger-edge-connectedness and strongly Menger-vertex-connectedness of regular networks.
Theor. Comput. Sci., 2018
Int. J. Comput. Math. Comput. Syst. Theory, 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
Discret. Appl. Math., 2018
A note on the directed genus of <i>K</i><sub><i>n</i>, <i>n</i>, <i>n</i></sub> and <i>K</i><sub><i>n</i></sub>.
Ars Math. Contemp., 2018
Fault-tolerance of balanced hypercubes with faulty vertices and faulty edges.
Ars Comb., 2018
Appl. Math. Comput., 2018
2017
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs.
Theor. Comput. Sci., 2017
J. Interconnect. Networks, 2017
Discret. Appl. Math., 2017
2016
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs.
Theor. Comput. Sci., 2016
Theor. Comput. Sci., 2016
J. Interconnect. Networks, 2016
J. Interconnect. Networks, 2016
J. Interconnect. Networks, 2016
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes.
Int. J. Comput. Math. Comput. Syst. Theory, 2016
2015
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges.
J. Interconnect. Networks, 2015
Inf. Process. Lett., 2015
2014
Inf. Sci., 2014
Appl. Math. Comput., 2014
2013
2012
Graphs Comb., 2012
Orientable Embedding Distributions by Genus of Crossing-Digraph.
Ars Comb., 2012
2009
2008
Appl. Math. Lett., 2008