On the public citation graph
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
0 signed · 103 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.1006/jpdc.2001.1813openalex-snapshot
Fault-Tolerant Hamiltonicity of Twisted Cubes
inferredcites →https://doi.org/10.1007/3-540-45071-8_33openalex-snapshot
Fault-Hamiltonicity of Product Graph of Path and Cycle
inferredcites →https://doi.org/10.1007/978-1-349-03521-2openalex-snapshot
Graph Theory with Applications
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_42openalex-snapshot
One-to-Many Disjoint Path Covers in a Graph with Faulty Elements
inferredcites →https://doi.org/10.1007/978-3-540-27798-9_44openalex-snapshot
Fault Hamiltonicity of Meshes with Two Wraparound Edges
inferredcites →https://doi.org/10.1007/978-3-540-30551-4_64openalex-snapshot
Many-to-Many Disjoint Path Covers in a Graph with Faulty Elements
inferredcites →https://doi.org/10.1016/0020-0190(95)00054-gopenalex-snapshot
On the generalized twisted cube
inferredcites →https://doi.org/10.1016/j.ipl.2004.03.009openalex-snapshot
Hamiltonian properties on the class of hypercube-like networks
inferredcites →https://doi.org/10.1016/j.jpdc.2004.08.004openalex-snapshot
Longest paths and cycles in faulty star graphs
inferredcites →https://doi.org/10.1016/j.tcs.2004.01.035openalex-snapshot
Linear array and ring embeddings in conditional faulty hypercubes
inferredcites →https://doi.org/10.1016/s0020-0190(98)00159-8openalex-snapshot
On ring embedding in hypercubes with faulty nodes and links
inferredcites →https://doi.org/10.1016/s0045-7906(96)00032-8openalex-snapshot
Fault-tolerant embedding of linear arrays and rings in the star graph
inferredcites →https://doi.org/10.1016/s0096-3003(02)00933-5openalex-snapshot
On some super fault-tolerant Hamiltonian graphs
inferredcites →https://doi.org/10.1016/s0167-8191(03)00058-9openalex-snapshot
Fault-tolerant cycle embedding in the hypercube
inferredcites →https://doi.org/10.1016/s0304-3975(00)00176-6openalex-snapshot
Recursive circulants and their embeddings among hypercubes
inferredcites →https://doi.org/10.1109/12.102840openalex-snapshot
A variation on the hypercube with lower diameter
inferredcites →https://doi.org/10.1109/12.67323openalex-snapshot
The twisted N-cube with application to multiprocessing
inferredcites →https://doi.org/10.1109/12.954510openalex-snapshot
Longest fault-free paths in star graphs with edge faults
inferredcites →https://doi.org/10.1109/71.159036openalex-snapshot
The crossed cube architecture for parallel computation
inferredcites →https://doi.org/10.1109/71.640010openalex-snapshot
Fault-tolerant ring embedding in a star graph with both link and node failures
inferredcites →https://doi.org/10.1109/71.755822openalex-snapshot
Fault-free Hamiltonian cycles in faulty arrangement graphs
inferredcites →https://doi.org/10.1109/icpads.2001.934807openalex-snapshot
Ring embedding in faulty (n,k)-star graphs
inferredcites →https://doi.org/10.1109/ipps.1995.395907openalex-snapshot
The Mcube: a symmetrical cube based network with twisted links
inferredcites →https://doi.org/10.1109/spdp.1993.395450openalex-snapshot
A class of hypercube-like networks
inferredcites →https://doi.org/10.1109/tc.2004.1255789openalex-snapshot
Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4589641openalex-extracted
Structure Connectivity and Substructure Connectivity of Folded Crossed Cubes
inferred← citeshttps://doi.org/10.1007/11942634_31openalex-snapshot
Panconnectivity and Pancyclicity of Hypercube-Like Interconnection Networks with Faulty Elements
inferred← citeshttps://doi.org/10.1007/11942634_32openalex-snapshot
Embedding Starlike Trees into Hypercube-Like Interconnection Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_8openalex-snapshot
Improved Precise Fault Diagnosis Algorithm for Hypercube-Like Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-79228-4_14openalex-snapshot
Hamiltonicity of Matching Composition Networks with Conditional Edge Faults
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_63openalex-snapshot
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
inferred← citeshttps://doi.org/10.1007/s10878-008-9157-xopenalex-snapshot
Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
inferred← citeshttps://doi.org/10.1007/s10878-019-00441-xopenalex-snapshot
Fractional matching preclusion of the restricted HL-graphs
inferred← citeshttps://doi.org/10.1007/s11227-013-0883-1openalex-snapshot
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2005.11.080openalex-snapshot
A lower bound on the size of k-neighborhood in generalized cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2015.06.081openalex-snapshot
A Fast Parallel Algorithm for Constructing Independent Spanning Trees on Parity Cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2020.125564openalex-snapshot
The bipanconnectivity of bipartite hypercube-like networks
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126090openalex-snapshot
Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.09.021openalex-snapshot
Network load-aware content distribution in overlay networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2009.01.011openalex-snapshot
Optimal node-selection algorithm for parallel download in overlay content-distribution networks
inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.002openalex-snapshot
Strong matching preclusion under the conditional fault model
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.039openalex-snapshot
Matching preclusion and conditional edge-fault Hamiltonicity of binary de Bruijn graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.011openalex-snapshot
Hamiltonian cycles and paths in faulty twisted hypercubes
inferred← citeshttps://doi.org/10.1016/j.dam.2020.09.008openalex-snapshot
Torus-like graphs and their paired many-to-many disjoint path covers
inferred← citeshttps://doi.org/10.1016/j.ic.2016.10.002openalex-snapshot
Conditional edge-fault hamiltonian-connectivity of restricted hypercube-like networks
inferred← citeshttps://doi.org/10.1016/j.ins.2010.03.005openalex-snapshot
Conditional edge-fault Hamiltonicity of augmented cubes☆
inferred← citeshttps://doi.org/10.1016/j.ins.2010.06.001openalex-snapshot
Embedding meshes into locally twisted cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2011.02.019openalex-snapshot
Embedding meshes into twisted-cubes
inferred← citeshttps://doi.org/10.1016/j.ins.2013.04.013openalex-snapshot
Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2005.10.003openalex-snapshot
Minimum neighborhood in a generalized cube
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.06.011openalex-snapshot
Wirelength of 1-fault hamiltonian graphs into wheels and fans
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.05.007openalex-snapshot
Disjoint path covers with path length constraints in restricted hypercube-like graphs
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.02.005openalex-snapshot
Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
inferred← citeshttps://doi.org/10.1016/j.kjs.2023.03.008openalex-snapshot
Panconnectivity algorithm for Eisenstein-Jacobi networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.029openalex-snapshot
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.10.016openalex-snapshot
Panconnectivity and edge-pancyclicity of faulty recursive circulant G ( 2 m , 4 )
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.02.041openalex-snapshot
Conditional matching preclusion for hypercube-like interconnection networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.034openalex-snapshot
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.04.045openalex-snapshot
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.08.020openalex-snapshot
An algorithm to construct independent spanning trees on parity cubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.034openalex-snapshot
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.014openalex-snapshot
Many-to-many two-disjoint path covers in restricted hypercube-like graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.12.036openalex-snapshot
Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114449openalex-snapshot
Integer k-matching preclusion of some interconnection networks
inferred← citeshttps://doi.org/10.1080/00207160.2012.656614openalex-snapshot
General-demand disjoint path covers in a graph with faulty elements
inferred← citeshttps://doi.org/10.1080/00207160.2014.890715openalex-snapshot
The bicube: an interconnection of two hypercubes
inferred← citeshttps://doi.org/10.1080/02533839.2025.2491435openalex-snapshot
Edge-disjoint spanning trees in the Möbius cube
inferred← citeshttps://doi.org/10.1080/17445760902774070openalex-snapshot
Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
inferred← citeshttps://doi.org/10.1093/comjnl/bxv019openalex-snapshot
Hamiltonian Properties of DCell Networks
inferred← citeshttps://doi.org/10.1109/access.2018.2882520openalex-snapshot
Fault-Tolerant Hamiltonian Connectivity of Twisted Hypercube-Like Networks THLNs
inferred← citeshttps://doi.org/10.1109/csae.2011.5952464openalex-snapshot
Construction of independent spanning trees on twisted-cubes
inferred← citeshttps://doi.org/10.1109/cse.2014.225openalex-snapshot
Parallel Construction of Independent Spanning Trees on Parity Cubes
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228456openalex-snapshot
The conditional diagnosability of locally twisted cubes
inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234748openalex-snapshot
Path embedding in faulty locally twisted cubes
inferred← citeshttps://doi.org/10.1109/iccsn.2017.8230266openalex-snapshot
An algorithm to embed Hamiltonian path into ECQ network
inferred← citeshttps://doi.org/10.1109/icisce.2015.21openalex-snapshot
A Parallel Algorithm to Construct BISTs on Parity Cubes
inferred← citeshttps://doi.org/10.1109/icnisc.2016.040openalex-snapshot
Conditional Edge Fault-Tolerant Hamiltonian-Connected of Locally Twisted Cubes LTQn
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447759openalex-snapshot
Fault-free Hamiltonian cycles in locally twisted cubes under conditional edge faults
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536124openalex-snapshot
On the construction of paired many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1109/tc.2008.160openalex-snapshot
Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements
inferred← citeshttps://doi.org/10.1109/tc.2010.229openalex-snapshot
Pancyclicity of Matching Composition Networks under the Conditional Fault 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.2006.37openalex-snapshot
Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1109/tpds.2008.123openalex-snapshot
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.103openalex-snapshot
Hamiltonicity of Product Networks with Faulty Elements
inferred← citeshttps://doi.org/10.20429/tag.2019.060202openalex-snapshot
Fractional strong matching preclusion for two variants of hypercubes
inferred← citeshttps://doi.org/10.2298/aadm161013027sopenalex-snapshot
Fault-tolerant designs in triangular lattice networks
inferred← citeshttps://doi.org/10.2298/fil1801071bopenalex-snapshot
Hamiltonian properties on a class of circulant interconnection networks
inferred← citeshttps://doi.org/10.3390/math7111066openalex-snapshot
Fault-Tolerant Path-Embedding of Twisted Hypercube-Like Networks (THLNs)
inferred← citeshttps://doi.org/10.3745/kipsta.2011.18a.6.225openalex-snapshot
Hamiltonian Paths in Restricted Hypercube-Like Graphs with Edge Faults
inferred← citeshttps://doi.org/10.3906/mat-1502-32openalex-snapshot
Highly non-concurrent longest paths in lattices
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.336-338.2248openalex-snapshot
Embedding Two Edge-Disjoint Hamiltonian Cycles into Parity Cubes
inferred← citeshttps://doi.org/10.4171/rsmup/132-6openalex-snapshot
Lattice graphs with non-concurrent longest cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1111.5391openalex-snapshot
Hamiltonian Connectivity of Twisted Hypercube-Like Networks under the Large Fault Model
inferred← citeshttps://doi.org/10.48550/arxiv.1902.03391openalex-snapshot
Embedding onto Wheel-like Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2001.03713openalex-snapshot
Fractional matching preclusion of fault Hamiltonian graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2013.1.1.6openalex-snapshot
Intersecting longest paths and longest cycles: A survey
inferred← citeshttps://doi.org/10.5614/ejgta.2014.2.2.2openalex-snapshot
Fault-tolerant designs in lattice networks on the Klein bottle
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.