default search action
Xiang-Jun Li
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j23]Meijie Ma
, Xiang-Jun Li
Generalized fault-tolerance for enhanced hypercubes. Discret. Appl. Math. 342: 244-252 (2024) - [j22]Ying-Ze Zhao, Xiang-Jun Li
Reliability of m-ary n-dimensional hypercubes under embedded restriction. Discret. Appl. Math. 349: 182-189 (2024) - [j21]Si-Yu Li, Xiang-Jun Li
Reliability assessment for k-ary n-cubes with faulty edges. J. Parallel Distributed Comput. 190: 104886 (2024) - [j20]Chaoming Guo
The Rabin numbers of enhanced hypercubes. J. Parallel Distributed Comput. 191: 104905 (2024) - 2023
- [j19]Meijie Ma
Strong Menger Connectivity of Folded Hypercubes with Faulty Subcube. Int. J. Found. Comput. Sci. 34(5): 443-451 (2023) - [j18]Meijie Ma
Disjoint paths in the enhanced hypercube with a faulty subgraph. J. Appl. Math. Comput. 69(2): 1343-1354 (2023) - 2022
- [j17]Xiang-Jun Li
Note on reliability evaluation of arrangement graphs. Appl. Math. Comput. 418: 126845 (2022) - [j16]Ling Chen
Reliability assessment for modified bubble-sort networks. Discret. Appl. Math. 307: 88-94 (2022) - [j15]Jia-Xiong Dan, Zhi-Bo Zhu, Xin-Kui Yang, Ru-Yi Li, Wei-Jie Zhao, Xiang-Jun Li
The signed edge-domatic number of nearly cubic graphs. J. Comb. Optim. 44(1): 435-445 (2022) - [j14]Rui Zhu, Xue-Qian Zeng, Xiang-Jun Li
Reliability of arrangement networks in terms of the h-restricted edge connectivity. J. Parallel Distributed Comput. 170: 68-73 (2022) - [j13]Chai Shu, Xiang-Jun Li
Note on reliability of star graphs. Theor. Comput. Sci. 923: 366-375 (2022) - [j12]Ying-Ze Zhao, Xiang-Jun Li
Embedded connectivity of some BC networks. J. Supercomput. 78(14): 16605-16618 (2022)
2010 – 2019
- 2019
- [j11]Xiang-Jun Li
Generalized measures of fault tolerance for bubble sort networks. Appl. Math. Comput. 363 (2019) - [j10]Xiang-Jun Li
On conditional fault tolerance of hierarchical cubic networks. Theor. Comput. Sci. 761: 1-6 (2019) - 2017
- [j9]Xiang-Jun Li
Many-to-many disjoint paths in hypercubes with faulty vertices. Discret. Appl. Math. 217: 229-242 (2017) - [j8]Xiang-Jun Li
On fault tolerance of (n, k)-star networks. Theor. Comput. Sci. 704: 82-86 (2017) - 2016
- [j7]Xiang-Jun Li
Embedded connectivity of recursive networks. Theor. Comput. Sci. 653: 79-86 (2016) - 2015
- [j6]Xiang-Jun Li:
k-Connected Graphs Without K4. Ars Comb. 119: 353-362 (2015) - [c1]Xiang-Jun Li, Cheng-Lin Liu, Fei Liu:
Coupled-group consensus seeking for second-order multi-agent systems with communication delay. ICIA 2015: 2541-2546 - 2014
- [j5]Xiang-Jun Li
Fault-tolerance of (n, k)-star networks. Appl. Math. Comput. 248: 525-530 (2014) - [j4]Xiang-Jun Li
Generalized measures for fault tolerance of star networks. Networks 63(3): 225-230 (2014) - 2013
- [j3]Xiang-Jun Li
The Signed Edge-Domatic Number of a Graph. Graphs Comb. 29(6): 1881-1890 (2013) - [j2]Xiang-Jun Li
Generalized measures of fault tolerance in exchanged hypercubes. Inf. Process. Lett. 113(14-16): 533-537 (2013) - [j1]Xiang-Jun Li
Edge-fault tolerance of hypercube-like networks. Inf. Process. Lett. 113(19-21): 760-763 (2013)
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-12-02 22:27 CET 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: