| Super Extra Edge-Connectivity In Regular Networks With Edge Faults | 0 | 0.34 | 2021 |
| Faulty Diagnosability Andg-Extra Connectivity Of Dqcube | 0 | 0.34 | 2021 |
| Reliability of DQcube Based on g-Extra Conditional Fault | 0 | 0.34 | 2021 |
| Cyclic Connectivity Of The Data Center Network | 0 | 0.34 | 2021 |
| Sufficient conditions for graphs to be spanning connected | 0 | 0.34 | 2020 |
| Cyclic Vertex-Connectivity Of Cartesian Product Graphs | 0 | 0.34 | 2020 |
| Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs | 0 | 0.34 | 2020 |
| Supereulerian 3-path-quasi-transitive digraphs. | 0 | 0.34 | 2020 |
| Edge fault tolerance of graphs with respect to λ2-optimal property | 1 | 0.39 | 2019 |
| Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. | 0 | 0.34 | 2019 |
| Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph | 0 | 0.34 | 2019 |
| Arc Fault Tolerance of Maximally Arc-Connected Networks Modeled By Digraphs. | 0 | 0.34 | 2019 |
| The -spectral radius of trees and unicyclic graphs with given degree sequence. | 0 | 0.34 | 2019 |
| Edge fault tolerance of interconnection networks with respect to maximally edge-connectivity. | 0 | 0.34 | 2019 |
| -spectral radius of the second power of a graph. | 0 | 0.34 | 2019 |
| On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. | 1 | 0.40 | 2019 |
| Sufficient conditions for hypergraphs to be maximally edge-connected. | 0 | 0.34 | 2018 |
| Partitioning the Cartesian product of a tree and a cycle. | 0 | 0.34 | 2018 |
| Connectivity keeping stars or double-stars in 2-connected graphs. | 1 | 0.40 | 2018 |
| Connectivity of half vertex transitive digraphs. | 0 | 0.34 | 2018 |
| Steiner tree packing number and tree connectivity. | 5 | 0.47 | 2018 |
| Super Rk-vertex-connectedness. | 0 | 0.34 | 2018 |
| Matching preclusion for n-dimensional torus networks. | 2 | 0.36 | 2017 |
| Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs. | 1 | 0.39 | 2017 |
| Maximally connected and super arc-connected Bi-Cayley digraphs | 0 | 0.34 | 2016 |
| Arc-connectivity of regular digraphs with two orbits. | 0 | 0.34 | 2016 |
| Construction of super edge-connected multigraphs with prescribed degrees. | 0 | 0.34 | 2016 |
| On the page number of triple-loop networks with even cardinality. | 0 | 0.34 | 2016 |
| Strong matching preclusion for n-dimensional torus networks. | 1 | 0.37 | 2016 |
| The Harary index of digraphs. | 0 | 0.34 | 2015 |
| λ'-optimal regular graphs with two orbits. | 1 | 0.37 | 2015 |
| Restricted Connectivity for Some Interconnection Networks | 0 | 0.34 | 2015 |
| Domination in lexicographic product digraphs. | 0 | 0.34 | 2015 |
| Local-restricted-edge-connectivity of graphs. | 0 | 0.34 | 2014 |
| Reliability analysis of bijective connection networks in terms of the extra edge-connectivity. | 6 | 0.42 | 2014 |
| On the existence of super edge-connected graphs with prescribed degrees. | 0 | 0.34 | 2014 |
| On super restricted edge-connectivity of vertex-transitive graphs. | 0 | 0.34 | 2014 |
| On strongly Z2s-1-connected graphs. | 0 | 0.34 | 2014 |
| The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs | 0 | 0.34 | 2014 |
| Super connectivity and super arc connectivity of the Mycielskian of a digraph. | 0 | 0.34 | 2013 |
| The Diameters of Almost All Bi-Cayley Graphs. | 0 | 0.34 | 2013 |
| Domination number in iterated line digraph of a complete bipartite digraph. | 0 | 0.34 | 2012 |
| The Properties of Transformation Digraphs Dxyz. | 0 | 0.34 | 2012 |
| On the connectivity of p-diamond-free vertex transitive graphs. | 0 | 0.34 | 2012 |
| λ'-Optimality of Bipartite Digraphs | 2 | 0.40 | 2012 |
| Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees. | 7 | 0.51 | 2012 |
| Super restricted edge connectivity of regular graphs with two orbits. | 2 | 0.38 | 2012 |
| Generalized measures of fault tolerance in hypercube networks. | 10 | 0.66 | 2012 |
| Edge fault tolerance of graphs with respect to super edge connectivity | 9 | 0.53 | 2012 |
| Inverse Degree And Super Edge-Connectivity | 0 | 0.34 | 2012 |
