default search action
Eminjan Sabir
Person information
- affiliation: Xinjiang University, Ürümqi, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j22]Eminjan Sabir, Jixiang Meng, Hongwei Qiao:
On spanning laceability of bipartite graphs. Appl. Math. Comput. 480: 128919 (2024) - [j21]Weiyan Wu, Eminjan Sabir:
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle. Axioms 12(9): 861 (2024) - [j20]Hongwei Qiao, Jixiang Meng, Eminjan Sabir:
The edge fault-tolerant two-disjoint path covers of Cayley graphs generated by a transposition tree. Discret. Appl. Math. 356: 174-181 (2024) - [j19]Eminjan Sabir
, Jianxi Fan
Structure Fault-Tolerant Hamiltonian Cycle and Path Embeddings in Bipartite $k$-Ary $n$-Cube Networks. IEEE Trans. Reliab. 73(1): 257-269 (2024) - 2023
- [j18]Xuemei Liu, Jixiang Meng
Component connectivity of the data center network DCell. Appl. Math. Comput. 444: 127822 (2023) - [j17]Hongwei Qiao, Eminjan Sabir, Jixiang Meng:
The spanning cyclability of Cayley graphs generated by transposition trees. Discret. Appl. Math. 328: 60-69 (2023) - [j16]Eminjan Sabir, Jixiang Meng:
Degree sequence conditions for a graph to be disjoint path coverable. Discret. Appl. Math. 332: 62-69 (2023) - [j15]Weiyan Wu, Eminjan Sabir, Hongwei Qiao:
Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle. Int. J. Parallel Emergent Distributed Syst. 38(5): 342-361 (2023) - [j14]Hongwei Qiao, Jixiang Meng, Eminjan Sabir:
The edge fault-tolerant spanning laceability of the enhanced hypercube networks. J. Supercomput. 79(6): 6070-6086 (2023) - [j13]Xueli Sun, Jianxi Fan, Eminjan Sabir, Baolei Cheng, Jia Yu:
Reliability of augmented k-ary n-cubes under the extra connectivity condition. J. Supercomput. 79(12): 13641-13669 (2023) - 2022
- [j12]Hongwei Qiao, Jixiang Meng
Embedding spanning disjoint cycles in enhanced hypercube networks with prescribed vertices in each cycle. Appl. Math. Comput. 435: 127481 (2022) - [j11]Huimei Guo
The g-extra connectivity of folded crossed cubes. J. Parallel Distributed Comput. 166: 139-146 (2022) - 2021
- [j10]Eminjan Sabir, Jixiang Meng:
Generalizations of the classics to spanning connectedness. Appl. Math. Comput. 403: 126167 (2021) - [j9]Eminjan Sabir, Jixiang Meng:
Structure Fault Tolerance of Recursive Interconnection Networks. Comput. J. 64(1): 64-75 (2021) - [j8]Lili Yuan
The Antistrong Property for Special Digraph Families. Graphs Comb. 37(6): 2511-2519 (2021) - [j7]Eminjan Sabir, Jixiang Meng:
Fault-tolerant Hamiltonicity of hypercubes with faulty subcubes. Inf. Process. Lett. 172: 106160 (2021) - [j6]Subinur Dilixiati
Star structure connectivities of pancake graphs and burnt pancake graphs. Int. J. Parallel Emergent Distributed Syst. 36(5): 440-448 (2021) - 2020
- [j5]Eminjan Sabir, Jixiang Meng:
Sufficient conditions for graphs to be spanning connected. Appl. Math. Comput. 378: 125198 (2020)
2010 – 2019
- 2019
- [j4]Eminjan Sabir, Jixiang Meng:
Parallel routing in regular networks with faults. Inf. Process. Lett. 142: 84-89 (2019) - [j3]Eminjan Sabir, Aygul Mamut, Elkin Vumar:
The extra connectivity of the enhanced hypercubes. Theor. Comput. Sci. 799: 22-31 (2019) - 2018
- [j2]Eminjan Sabir, Jixiang Meng:
Structure fault tolerance of hypercubes and folded hypercubes. Theor. Comput. Sci. 711: 44-55 (2018) - 2014
- [j1]Eminjan Sabir, Elkin Vumar:
Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph. Graphs Comb. 30(6): 1551-1563 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: