Eminjan Sabir

Orcid: 0000-0003-1456-4539

Affiliations:
  • Xinjiang University, Ürümqi, China


According to our database1, Eminjan Sabir authored at least 20 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle.
Axioms, September, 2024

Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks.
IEEE Trans. Reliab., March, 2024

2023
Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle.
Int. J. Parallel Emergent Distributed Syst., September, 2023

Reliability of augmented k-ary n-cubes under the extra connectivity condition.
J. Supercomput., August, 2023

Degree sequence conditions for a graph to be disjoint path coverable.
Discret. Appl. Math., June, 2023

Component connectivity of the data center network DCell.
Appl. Math. Comput., May, 2023

The edge fault-tolerant spanning laceability of the enhanced hypercube networks.
J. Supercomput., April, 2023

The spanning cyclability of Cayley graphs generated by transposition trees.
Discret. Appl. Math., March, 2023

2022
The <i>g</i>-extra connectivity of folded crossed cubes.
J. Parallel Distributed Comput., 2022

Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle.
Appl. Math. Comput., 2022

2021
Star structure connectivities of pancake graphs and burnt pancake graphs.
Int. J. Parallel Emergent Distributed Syst., 2021

Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes.
Inf. Process. Lett., 2021

The Antistrong Property for Special Digraph Families.
Graphs Comb., 2021

Structure Fault Tolerance of Recursive Interconnection Networks.
Comput. J., 2021

Generalizations of the classics to spanning connectedness.
Appl. Math. Comput., 2021

2020
Sufficient conditions for graphs to be spanning connected.
Appl. Math. Comput., 2020

2019
The extra connectivity of the enhanced hypercubes.
Theor. Comput. Sci., 2019

Parallel routing in regular networks with faults.
Inf. Process. Lett., 2019

2018
Structure fault tolerance of hypercubes and folded hypercubes.
Theor. Comput. Sci., 2018

2014
Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph.
Graphs Comb., 2014


  Loading...