Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph. - Eminjan Sabir; Elkin Vumar (Graphs Comb., 2014)

Structure fault tolerance of hypercubes and folded hypercubes. - Eminjan Sabir; Jixiang Meng (Theor. Comput. Sci., 2018)

Parallel routing in regular networks with faults. - Eminjan Sabir; Jixiang Meng (Inf. Process. Lett., 2019)

The extra connectivity of the enhanced hypercubes. - Eminjan Sabir; Aygul Mamut; Elkin Vumar (Theor. Comput. Sci., 2019)

Sufficient conditions for graphs to be spanning connected. - Eminjan Sabir; Jixiang Meng (Appl. Math. Comput., 2020)

Generalizations of the classics to spanning connectedness. - Eminjan Sabir; Jixiang Meng (Appl. Math. Comput., 2021)

Structure Fault Tolerance of Recursive Interconnection Networks. - Eminjan Sabir; Jixiang Meng (Comput. J., 2021)

The Antistrong Property for Special Digraph Families. - Lili Yuan; Jixiang Meng; Eminjan Sabir (Graphs Comb., 2021)

Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes. - Eminjan Sabir; Jixiang Meng (Inf. Process. Lett., 2021)

Star structure connectivities of pancake graphs and burnt pancake graphs. - Subinur Dilixiati; Eminjan Sabir; Jixiang Meng (Int. J. Parallel Emergent Distributed Syst., 2021)

Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle. - Hongwei Qiao; Jixiang Meng; Eminjan Sabir (Appl. Math. Comput., 2022)

The g-extra connectivity of folded crossed cubes. - Huimei Guo; Eminjan Sabir; Aygul Mamut (J. Parallel Distributed Comput., 2022)

The spanning cyclability of Cayley graphs generated by transposition trees. - Hongwei Qiao; Eminjan Sabir; Jixiang Meng (Discret. Appl. Math., 2023)

The edge fault-tolerant spanning laceability of the enhanced hypercube networks. - Hongwei Qiao; Jixiang Meng; Eminjan Sabir (J. Supercomput., 2023)

Component connectivity of the data center network DCell. - Xuemei Liu; Jixiang Meng; Eminjan Sabir (Appl. Math. Comput., 2023)

Degree sequence conditions for a graph to be disjoint path coverable. - Eminjan Sabir; Jixiang Meng (Discret. Appl. Math., 2023)

Reliability of augmented k-ary n-cubes under the extra connectivity condition. - Xueli Sun; Jianxi Fan; Eminjan Sabir; Baolei Cheng; Jia Yu 003 (J. Supercomput., 2023)

Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle. - Weiyan Wu; Eminjan Sabir; Hongwei Qiao (Int. J. Parallel Emergent Distributed Syst., 2023)

On spanning laceability of bipartite graphs. - Eminjan Sabir; Jixiang Meng; Hongwei Qiao (Appl. Math. Comput., 2024)

The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree. - Hongwei Qiao; Jixiang Meng; Eminjan Sabir (Discret. Appl. Math., 2024)

On Spanning Wide Diameter of Spider Web Networks. - Yameng Wang; Eminjan Sabir (Parallel Process. Lett., 2024)

Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks. - Eminjan Sabir; Jianxi Fan; Jixiang Meng; Baolei Cheng (IEEE Trans. Reliab., 2024)

Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle. - Weiyan Wu; Eminjan Sabir (Axioms, 2024)

Robustness of reliability bounds for (n,k)-star networks. - Hao Li; Hongwei Qiao; Eminjan Sabir (Discret. Appl. Math., 2025)

Spanning Edge Cyclability of Enhanced Hypercube Networks. - Yuzhang Chen; Eminjan Sabir (Parallel Process. Lett., 2025)

Super spanning connectivity of the generalized hypercube network. - Xiaoqian Wang; Eminjan Sabir (Theor. Comput. Sci., 2025)

Further combinatorial analysis of substar reliability in star networks. - Hao Li; Eminjan Sabir (J. Comb. Optim., 2025)