On the public citation graph
w‐Rabin numbers and strong w‐Rabin numbers of folded hypercubes
0 signed · 32 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199710)30:3<219::aid-net6>3.0.co;2-oopenalex-snapshot
On the Rabin number problem
inferredcites →https://doi.org/10.1002/net.20002openalex-snapshot
Complete binary trees in folded and enhanced cubes
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-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/s00224-004-1115-0openalex-snapshot
Generalized Diameters of the Mesh of Trees
inferredcites →https://doi.org/10.1016/j.aml.2005.04.002openalex-snapshot
Cycles in folded hypercubes
inferredcites →https://doi.org/10.1016/j.tcs.2005.02.010openalex-snapshot
Strong Rabin numbers of folded hypercubes
inferredcites →https://doi.org/10.1016/s0012-365x(98)00175-7openalex-snapshot
Rabin numbers of Butterfly networks
inferredcites →https://doi.org/10.1109/12.743415openalex-snapshot
Fault tolerance properties of pyramid networks
inferredcites →https://doi.org/10.1109/71.395400openalex-snapshot
Algorithms and properties of a new two-level network with folded hypercubes as basic modules
inferredcites →https://doi.org/10.1109/71.577263openalex-snapshot
Multiple-edge-fault tolerance with respect to hypercubes
inferredcites →https://doi.org/10.1109/71.640011openalex-snapshot
Nearly optimal one-to-many parallel routing in star networks
inferredcites →https://doi.org/10.1109/71.80187openalex-snapshot
Properties and performance of folded hypercubes
inferredcites →https://doi.org/10.1109/tpds.2005.109openalex-snapshot
Hamiltonicity of the WK-recursive network with and without faulty nodes
inferredcites →https://doi.org/10.1145/62044.62050openalex-snapshot
Efficient dispersal of information for security, load balancing, and fault tolerance
inferredcites →https://doi.org/10.6688/jise.2000.16.2.5openalex-snapshot
Incrementally extensible folded hypercube graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11227-018-2456-9openalex-snapshot
A stochastic link-fault-tolerant routing algorithm in folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.ins.2013.07.016openalex-snapshot
Construction of optimal independent spanning trees on folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.05.024openalex-snapshot
Fault-free cycles in folded hypercubes with more faulty elements
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.12.005openalex-snapshot
An efficient construction of one-to-many node-disjoint paths in folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2020.09.005openalex-snapshot
Optimal node-disjoint paths in folded hypercubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2024.104905openalex-snapshot
The Rabin numbers of enhanced hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.026openalex-snapshot
ω -wide diameters of enhanced pyramid networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.11.009openalex-snapshot
Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.06.008openalex-snapshot
On g-extra connectivity of folded hypercubes
inferred← citeshttps://doi.org/10.1080/00207160903501925openalex-snapshot
A note on embeddings among folded hypercubes, even graphs and odd graphs
inferred← citeshttps://doi.org/10.1109/tc.2013.10openalex-snapshot
On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
inferred← citeshttps://doi.org/10.1109/tdsc.2009.52openalex-snapshot
Diagnosability of Two-Matching Composition Networks under the MM{}^{\ast} Model
inferred← citeshttps://doi.org/10.1109/tdsc.2010.22openalex-snapshot
Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications
inferred← citeshttps://doi.org/10.1109/tpds.2011.261openalex-snapshot
Optimal Construction of All Shortest Node-Disjoint Paths in Hypercubes with Applications
inferred← citeshttps://doi.org/10.1142/s1793830923500283openalex-snapshot
Reliability measures in brother trees
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.