Остановите войну!
for scientists:
default search action
Rongxia Hao
- > Home > Persons > Rongxia Hao
Publications
- 2023
- [j93]Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee:
The 3-path-connectivity of the k-ary n-cube. Appl. Math. Comput. 436: 127499 (2023) - [j92]Wen-Han Zhu, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee:
Path connectivity of line graphs and total graphs of complete bipartite graphs. Appl. Math. Comput. 457: 128182 (2023) - 2021
- [j74]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng, Erling Wei:
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions. Discret. Appl. Math. 304: 137-152 (2021) - 2020
- [j64]Shengjie He, Rong-Xia Hao, Yan-Quan Feng:
On the edge-Szeged index of unicyclic graphs with perfect matchings. Discret. Appl. Math. 284: 207-223 (2020) - 2018
- [j39]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng, Ai-Mei Yu:
The 3-extra Connectivity and Faulty Diagnosability. Comput. J. 61(5): 672-686 (2018) - 2017
- [j25]Mei-Mei Gu, Rong-Xia Hao, Jun-Ming Xu, Yan-Quan Feng:
Equal relation between the extra connectivity and pessimistic diagnosability for some regular graphs. Theor. Comput. Sci. 690: 59-72 (2017) - 2016
- [j23]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng:
The pessimistic diagnosability of bubble-sort star graphs and augmented k-ary n-cubes. Int. J. Comput. Math. Comput. Syst. Theory 1(3-4): 98-112 (2016) - [j21]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng:
Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes. J. Interconnect. Networks 16(2): 1650002:1-1650002:17 (2016) - [j19]Rong-Xia Hao, Mei-Mei Gu, Yan-Quan Feng:
The pessimistic diagnosabilities of some general regular graphs. Theor. Comput. Sci. 609: 413-420 (2016) - 2015
- [j17]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Embedding even cycles on folded hypercubes with conditional faulty edges. Inf. Process. Lett. 115(12): 945-949 (2015) - [j15]Mei-Mei Gu, Rong-Xia Hao, Yan-Quan Feng:
Fault-Tolerant Cycle Embedding in Balanced Hypercubes with Faulty Vertices and Faulty Edges. J. Interconnect. Networks 15(1-2): 1550002:1-1550002:16 (2015) - 2014
- [j14]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Two node-disjoint paths in balanced hypercubes. Appl. Math. Comput. 242: 127-142 (2014) - [j13]Rong-Xia Hao, Ru Zhang, Yan-Quan Feng, Jin-Xin Zhou:
Hamiltonian cycle embedding for fault tolerance in balanced hypercubes. Appl. Math. Comput. 244: 447-456 (2014) - [j10]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Odd cycles embedding on folded hypercubes with conditional faulty edges. Inf. Sci. 282: 180-189 (2014) - [j9]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Vertex-fault-tolerant cycles embedding in balanced hypercubes. Inf. Sci. 288: 449-461 (2014) - 2013
- [j8]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Cycles embedding on folded hypercubes with faulty nodes. Discret. Appl. Math. 161(18): 2894-2900 (2013) - [j7]Rong-Xia Hao, Yan-Quan Feng, Jin-Xin Zhou:
Conditional Diagnosability of Alternating Group Graphs. IEEE Trans. Computers 62(4): 827-831 (2013) - [j6]Dongqin Cheng, Rong-Xia Hao, Yan-Quan Feng:
Conditional edge-fault pancyclicity of augmented cubes. Theor. Comput. Sci. 510: 94-101 (2013)
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 2023-09-28 02:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint