On the public citation graph

Complete binary trees in folded and enhanced cubes

https://doi.org/10.1002/net.20002
0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jpdc.2000.1681openalex-snapshot
Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_13openalex-snapshot
Embedding one Interconnection Network in Another
inferredcites →https://doi.org/10.1109/12.76405openalex-snapshot
Enhanced hypercubes
inferredcites →https://doi.org/10.1109/12.817401openalex-snapshot
Diagnosability of hypercubes and enhanced hypercubes under the comparison diagnosis model
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/dmcc.1991.633075openalex-snapshot
Fault Tolerance of the Cyclic Buddy Subcube Location Scheme in Hypercubes
inferredcites →https://doi.org/10.1109/ftcs.1992.243602openalex-snapshot
Optimal ring embedding in hypercubes with faulty links

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.20213openalex-snapshot
w‐Rabin numbers and strong w‐Rabin numbers of folded hypercubes
inferred← citeshttps://doi.org/10.1007/978-3-540-73814-5_22openalex-snapshot
A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes
inferred← citeshttps://doi.org/10.1007/s10255-016-0547-zopenalex-snapshot
Vertex-fault-tolerant cycles embedding on enhanced hypercube networks
inferred← citeshttps://doi.org/10.1007/s11227-014-1274-yopenalex-snapshot
Embedding complete binary trees into parity cubes
inferred← citeshttps://doi.org/10.1007/s11859-016-1158-5openalex-snapshot
Fault-tolerant cycles embedding in folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2010.12.001openalex-snapshot
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.007openalex-snapshot
Wirelength of hypercubes into certain trees
inferred← citeshttps://doi.org/10.1016/j.dam.2018.05.034openalex-snapshot
Wirelength of embedding complete multipartite graphs into certain graphs
inferred← citeshttps://doi.org/10.1016/j.disopt.2015.03.001openalex-snapshot
Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.12.005openalex-snapshot
Some results on topological properties of folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.jcss.2015.09.004openalex-snapshot
Complete binary trees embeddings in Möbius cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.11.005openalex-snapshot
Fault-tolerant embedding of complete binary trees in locally twisted cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104924openalex-snapshot
Routing and wavelength assignment for folded hypercube in linear array WDM optical networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.005openalex-snapshot
The bipanconnectivity and m -panconnectivity of the folded hypercube
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114562openalex-snapshot
Set-to-set disjoint paths in a folded hypercube
inferred← citeshttps://doi.org/10.1016/s0252-9602(12)60207-0openalex-snapshot
Paths and cycles embedding on faulty enhanced hypercube networks
inferred← citeshttps://doi.org/10.1016/s0252-9602(13)60106-xopenalex-snapshot
Vertex-Fault-Tolerant Cycles Embedding on Enhanced Hypercube Networks
inferred← citeshttps://doi.org/10.1080/17445760.2019.1651854openalex-snapshot
The extra connectivity of enhanced hypercubes
inferred← citeshttps://doi.org/10.1080/17445760.2019.1678620openalex-snapshot
The g-good-neighbour conditional diagnosability of enhanced hypercube under PMC model
inferred← citeshttps://doi.org/10.1080/23799927.2021.1963999openalex-snapshot
Optimal layout of recursive circulant graphs
inferred← citeshttps://doi.org/10.1093/comjnl/bxab029openalex-snapshot
The Matching Preclusion of Enhanced Hypercubes
inferred← citeshttps://doi.org/10.1093/comjnl/bxz071openalex-snapshot
{1,2,3}-Restricted Connectivity of $(n,k)$-Enhanced Hypercubes
inferred← citeshttps://doi.org/10.1109/cso.2010.133openalex-snapshot
The Wide Diameter of Folded Hypercube
inferred← citeshttps://doi.org/10.1109/csss.2011.5974791openalex-snapshot
Conditional edge-fault-tolerant Hamiltonicity of enhanced hypercube
inferred← citeshttps://doi.org/10.1109/fitme.2008.114openalex-snapshot
Cycles in Enhanced Hypercube Networks
inferred← citeshttps://doi.org/10.1109/iceice.2011.5777262openalex-snapshot
The connectivity of edge-fault-tolerant enhanced hypercube
inferred← citeshttps://doi.org/10.1109/icnc.2009.191openalex-snapshot
The Structural Features of Enhanced Hypercube Networks
inferred← citeshttps://doi.org/10.1109/isme.2010.82openalex-snapshot
The Disjoint Paths in Enhanced Hypercube
inferred← citeshttps://doi.org/10.1109/jcn.2012.6253071openalex-snapshot
Cycles in conditional faulty enhanced hypercube networks
inferred← citeshttps://doi.org/10.1109/msn.2015.24openalex-snapshot
Dynamic Reconfiguration of Complete Binary Trees in Faulty Locally Twisted Cubes
inferred← citeshttps://doi.org/10.1109/ncm.2008.264openalex-snapshot
Properties and Performance of Enhanced Hypercube Networks
inferred← citeshttps://doi.org/10.1109/tpds.2014.2367498openalex-snapshot
Parallel Construction of Independent Spanning Trees on Enhanced Hypercubes
inferred← citeshttps://doi.org/10.1109/yac63405.2024.10598647openalex-snapshot
Embedding Complete Binary Trees CBTn into Augmented Cubes AQn
inferred← citeshttps://doi.org/10.1504/ijnvo.2017.10004171openalex-snapshot
Exact wirelength of embedding chord graph into tree-based architectures
inferred← citeshttps://doi.org/10.3390/sym16010044openalex-snapshot
Cycle Embedding in Enhanced Hypercubes with Faulty Vertices
inferred← citeshttps://doi.org/10.5614/ejgta.2021.9.2.21openalex-snapshot
Embedding complete multi-partite graphs into Cartesian product of paths and cycles
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.