This page is a disambiguation page, it actually contains mutiple papers from persons of the same or a similar name.
2026
An infinite family of normal 5-edge colorable superpositioned snarks.
Discret. Appl. Math., 2026
2025
Structure connectivity of folded crossed cubes based on faulty stars.
J. Appl. Math. Comput., June, 2025
An infinite family of snarks with perfect matching cover index 4.
Graphs Comb., February, 2025
Packing internally disjoint Steiner paths of data center networks.
J. Supercomput., January, 2025
Five-cycle double cover and shortest cycle cover.
J. Graph Theory, January, 2025
2-edge-Hamilton-connected dragonfly network.
J. Parallel Distributed Comput., 2025
Minimum saturated graphs for unions of cliques.
Discret. Math., 2025
Non-separating cycles and 5-cycle double covers.
Discret. Math., 2025
The saturation number for unions of four cliques.
Discret. Math., 2025
4-coverable snarks, perfect matching cover, and Isaacs product.
Discret. Appl. Math., 2025
The ɛ-spectral radius of trees with perfect matchings.
Discret. Appl. Math., 2025
On perfect dominating sets in Cayley graphs.
Discret. Appl. Math., 2025
Perfect matching cover indices of generalized rotation snarks.
Appl. Math. Comput., 2025
2-Edge Hamiltonian connectedness: Characterization and results in data center networks.
Appl. Math. Comput., 2025
2024
Hyper star structure connectivity of hierarchical folded cubic networks.
J. Supercomput., July, 2024
Diagnosability of multigraph composition networks.
Theor. Comput. Sci., 2024
Reliability analysis of exchanged hypercubes based on the path connectivity.
Discret. Appl. Math., 2024
The 3-path-connectivity of the star graphs.
Discret. Appl. Math., 2024
Two-disjoint-cycle-cover pancyclicity of data center networks.
Appl. Math. Comput., 2024
2023
Path connectivity of line graphs and total graphs of complete bipartite graphs.
Appl. Math. Comput., November, 2023
Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs.
Discret. Appl. Math., October, 2023
The λ4-Connectivity of the Cartesian Product of Trees.
J. Interconnect. Networks, September, 2023
5-Cycle Double Covers, 4-Flows, and Catlin Reduction.
SIAM J. Discret. Math., March, 2023
The High Faulty Tolerant Capability of the Alternating Group Graphs.
IEEE Trans. Parallel Distributed Syst., 2023
On the <i>D</i><sub><i>α</i></sub>-spectral radius of cacti and bicyclic graphs.
Discret. Math., 2023
The 3-path-connectivity of the k-ary n-cube.
Appl. Math. Comput., 2023
2022
Construction of Dual-CISTs on an Infinite Class of Networks.
IEEE Trans. Parallel Distributed Syst., 2022
The 3-path-connectivity of the hypercubes.
Discret. Appl. Math., 2022
The vertex Turán density in 3-ary n-cubes.
Discret. Appl. Math., 2022
Bounds for the connected domination number of maximal outerplanar graphs.
Discret. Appl. Math., 2022
Internally disjoint trees in the line graph and total graph of the complete bipartite graph.
Appl. Math. Comput., 2022
Fault Diagnosability of Multigraph Matching Composition Networks.
Proceedings of the New Trends in Computer Technologies and Applications, 2022
2021
The vertex-pancyclicity of data center networks.
Theor. Comput. Sci., 2021
Packing internally disjoint Steiner trees to compute the <i>κ</i><sub>3</sub>-connectivity in augmented cubes.
J. Parallel Distributed Comput., 2021
Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs.
J. Graph Theory, 2021
Berge-Fulkerson coloring for some families of superposition snarks.
Eur. J. Comb., 2021
The generalized 4-connectivity of hierarchical cubic networks.
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
Reliability Assessment of Some Regular Networks.
Comput. J., 2021
Reliability Analysis of Alternating Group Graphs and Split-Stars.
Comput. J., 2021
Strong Menger Connectedness of Augmented k-ary n-cubes.
Comput. J., 2021
Reliability analysis based on the dual-CIST in shuffle-cubes.
Appl. Math. Comput., 2021
Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction.
Appl. Math. Comput., 2021
2020
The Existence of Completely Independent Spanning Trees for Some Compound Graphs.
IEEE Trans. Parallel Distributed Syst., 2020
Relationship between extra edge connectivity and component edge connectivity for regular graphs.
Theor. Comput. Sci., 2020
On Component Connectivity of Hierarchical Star Networks.
Int. J. Found. Comput. Sci., 2020
The fault tolerance of (n, k)-bubble-sort networks.
Discret. Appl. Math., 2020
Reliability assessment of the Cayley graph generated by trees.
Discret. Appl. Math., 2020
Comments on "A Hamilton sufficient condition for completely independent spanning tree".
Discret. Appl. Math., 2020
On the edge-Szeged index of unicyclic graphs with perfect matchings.
Discret. Appl. Math., 2020
Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs.
Discret. Appl. Math., 2020
Note on Applications of Linearly Many Faults.
Comput. J., 2020
On Computing Component (Edge) Connectivities of Balanced Hypercubes.
Comput. J., 2020
Two-disjoint-cycle-cover bipancyclicity of balanced hypercubes.
Appl. Math. Comput., 2020
2019
Fault diagnosability of data center networks.
Theor. Comput. Sci., 2019
Strongly Menger connectedness of data center network and (<i>n</i>, <i>k</i>)-star graph.
Theor. Comput. Sci., 2019
The generalized 3-connectivity of some Regular Networks.
J. Parallel Distributed Comput., 2019
Antimagic orientations for the complete k-ary trees.
J. Comb. Optim., 2019
A degree condition for fractional [<i>a</i>, <i>b</i>]-covered graphs.
Inf. Process. Lett., 2019
The Generalized Connectivity of Bubble-Sort Star Graphs.
Int. J. Found. Comput. Sci., 2019
Independence number, connectivity and all fractional (<i>a, b, k</i>)-critical graphs.
Discuss. Math. Graph Theory, 2019
Toughness condition for the existence of all fractional (a, b, k)-critical graphs.
Discret. Math., 2019
Antimagic orientations of disconnected even regular graphs.
Discret. Math., 2019
Two kinds of generalized connectivity of dual cubes.
Discret. Appl. Math., 2019
The Generalized Connectivity of (n, k)-Bubble-Sort Graphs.
Comput. J., 2019
The Generalized Three-Connectivity of Two Kinds of Cayley Graphs.
Comput. J., 2019
The generalized 4-connectivity of exchanged hypercubes.
Appl. Math. Comput., 2019
Constructing dual-CISTs of DCell data center networks.
Appl. Math. Comput., 2019
Reliability Assessment of Hierarchical Hypercube Networks.
IEEE Access, 2019
Measuring the Vulnerability of Alternating Group Graphs and Split-Star Networks in Terms of Component Connectivity.
IEEE Access, 2019
Structural Properties and Fault Resiliency of Interconnection Networks.
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
Berge-Fulkerson coloring for C(8)-linked graphs.
J. Graph Theory, 2018
The pessimistic diagnosability of data center networks.
Inf. Process. Lett., 2018
Fault-tolerance and diagnosability of hierarchical star networks.
Int. J. Comput. Math. Comput. Syst. Theory, 2018
The generalized connectivity of alternating group graphs and (n, k)-star graphs.
Discret. Appl. Math., 2018
Conditional edge-fault-tolerant Hamiltonicity of the data center network.
Discret. Appl. Math., 2018
Hamiltonian properties of some compound networks.
Discret. Appl. Math., 2018
Reliability analysis of Cayley graphs generated by transpositions.
Discret. Appl. Math., 2018
The Component Connectivity of Alternating Group Graphs and Split-Stars.
CoRR, 2018
The 3-extra Connectivity and Faulty Diagnosability.
Comput. J., 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
The linear (n-1)-arboricity of some lexicographic product graphs.
Appl. Math. Comput., 2018
2017
The g-good-neighbor diagnosability of (n, k)-star graphs.
Theor. Comput. Sci., 2017
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs.
Theor. Comput. Sci., 2017
The 1-Good-Neighbor Conditional Diagnosability of Some Regular Graphs.
J. Interconnect. Networks, 2017
On the extraconnectivity of k-ary n-cube networks.
Int. J. Comput. Math., 2017
On the Szeged index of unicyclic graphs with given diameter.
Discret. Appl. Math., 2017
The pessimistic diagnosability of three kinds of graphs.
Discret. Appl. Math., 2017
2016
Relationship between conditional diagnosability and 2-extra connectivity of symmetric graphs.
Theor. Comput. Sci., 2016
The pessimistic diagnosabilities of some general regular graphs.
Theor. Comput. Sci., 2016
A Note on the Pessimistic Diagnosability of Augmented Cubes.
J. Interconnect. Networks, 2016
A Short Note on the 1, 2-Good-Neighbor Diagnosability of Balanced Hypercubes.
J. Interconnect. Networks, 2016
Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes.
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
The genus of the balanced hypercube.
Discret. Math. Algorithms Appl., 2016
2015
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges.
J. Interconnect. Networks, 2015
Various cycles embedding in faulty balanced hypercubes.
Inf. Sci., 2015
Embedding even cycles on folded hypercubes with conditional faulty edges.
Inf. Process. Lett., 2015
2014
Vertex-fault-tolerant cycles embedding in balanced hypercubes.
Inf. Sci., 2014
Odd cycles embedding on folded hypercubes with conditional faulty edges.
Inf. Sci., 2014
Fault-tolerant cycles embedding in hypercubes with faulty edges.
Inf. Sci., 2014
3-extra connectivity of 3-ary n-cube networks.
Inf. Process. Lett., 2014
Hamiltonian cycle embedding for fault tolerance in balanced hypercubes.
Appl. Math. Comput., 2014
Two node-disjoint paths in balanced hypercubes.
Appl. Math. Comput., 2014
2013
Conditional edge-fault pancyclicity of augmented cubes.
Theor. Comput. Sci., 2013
Conditional Diagnosability of Alternating Group Graphs.
IEEE Trans. Computers, 2013
Cycles embedding on folded hypercubes with faulty nodes.
Discret. Appl. Math., 2013
2012
Counting Orientable Embeddings by Genus for a Type of 3-Regular Graph.
Graphs Comb., 2012
Orientable Embedding Distributions by Genus of Crossing-Digraph.
Ars Comb., 2012
2009
A note on Berge-Fulkerson coloring.
Discret. Math., 2009
The genus distributions of 4-regular digraphs.
Australas. J Comb., 2009
2008
The genus distributions of directed antiladders in orientable surfaces.
Appl. Math. Lett., 2008
