On the public citation graph
Fault-tolerant ring embedding in a star graph with both link and node failures
0 signed · 131 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/net.3230230403openalex-snapshot
Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry
inferredcites →https://doi.org/10.1006/jpdc.1994.1066openalex-snapshot
On Some Properties and Algorithms for the Star and Pancake Interconnection Networks
inferredcites →https://doi.org/10.1006/jpdc.1995.1006openalex-snapshot
Optimal Communication Algorithms on Star Graphs Using Spanning Tree Constructions
inferredcites →https://doi.org/10.1006/jpdc.1996.0120openalex-snapshot
On the Embedding of a Class of Regular Graphs in a Faulty Hypercube
inferredcites →https://doi.org/10.1016/0020-0190(93)90060-mopenalex-snapshot
On the fault-diameter of the star graph
inferredcites →https://doi.org/10.1016/0020-0190(94)90092-2openalex-snapshot
Fault tolerance of the star graph interconnection network
inferredcites →https://doi.org/10.1016/0020-0190(96)00114-7openalex-snapshot
Embedding a ring in a hypercube with both faulty links and faulty nodes
inferredcites →https://doi.org/10.1016/0743-7315(87)90018-9openalex-snapshot
On mapping parallel algorithms into parallel architectures
inferredcites →https://doi.org/10.1016/0743-7315(90)90110-bopenalex-snapshot
Mapping pyramid algorithms into hypercubes
inferredcites →https://doi.org/10.1016/0743-7315(91)90071-gopenalex-snapshot
Distributed fault-tolerant embeddings of rings in hypercubes
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.247843openalex-snapshot
A routing and broadcasting scheme on faulty star graphs
inferredcites →https://doi.org/10.1109/12.589231openalex-snapshot
Toward optimal broadcast in a star graph using multiple spanning trees
inferredcites →https://doi.org/10.1109/71.149958openalex-snapshot
Optimal broadcasting on the star graph
inferredcites →https://doi.org/10.1109/71.262586openalex-snapshot
A comparative study of topological properties of hypercubes and star graphs
inferredcites →https://doi.org/10.1109/71.296314openalex-snapshot
Communication aspects of the star graph interconnection network
inferredcites →https://doi.org/10.1109/71.388046openalex-snapshot
An optimal broadcasting algorithm without message redundancy in star graphs
inferredcites →https://doi.org/10.1109/71.508251openalex-snapshot
Balanced spanning trees in complete and incomplete star graphs
inferredcites →https://doi.org/10.1109/ftcs.1992.243602openalex-snapshot
Optimal ring embedding in hypercubes with faulty links
inferredcites →https://doi.org/10.1109/icpp.1993.159openalex-snapshot
Ring Embedding in an Injured Hypercube
inferredcites →https://doi.org/10.1109/ipps.1993.262806openalex-snapshot
On some topological properties of hypercube, incomplete hypercube and supercube
inferredcites →https://doi.org/10.1109/ipps.1995.395878openalex-snapshot
Broadcasting on the star and pancake interconnection networks
inferredcites →https://doi.org/10.1109/spdp.1990.143600openalex-snapshot
Embedding of cycles and grids in star graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(199905)33:3<221::aid-net8>3.0.co;2-kopenalex-snapshot
Congestion-free, dilation-2 embedding of complete binary trees into star graphs
inferred← citeshttps://doi.org/10.1002/(sici)1097-0037(200003)35:2<161::aid-net7>3.0.co;2-qopenalex-snapshot
Cycles in butterfly graphs
inferred← citeshttps://doi.org/10.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-gopenalex-snapshot
Hamiltonian-laceability of star graphs
inferred← citeshttps://doi.org/10.1002/1097-0037(200103)37:2<84::aid-net3>3.0.co;2-aopenalex-snapshot
Embedding longest fault-free paths in arrangement graphs with faulty vertices
inferred← citeshttps://doi.org/10.1002/net.10101openalex-snapshot
Fault‐tolerant cycle embedding in hierarchical cubic networks
inferred← citeshttps://doi.org/10.1002/net.20039openalex-snapshot
Panconnectivity, fault‐tolerant hamiltonicity and hamiltonian‐connectivity in alternating group graphs
inferred← citeshttps://doi.org/10.1002/net.20078openalex-snapshot
Mutually independent hamiltonian paths in star networks
inferred← citeshttps://doi.org/10.1002/net.6openalex-snapshot
On the construction of combinedk‐fault‐tolerant Hamiltonian graphs
inferred← citeshttps://doi.org/10.1006/jpdc.2001.1813openalex-snapshot
Fault-Tolerant Hamiltonicity of Twisted Cubes
inferred← citeshttps://doi.org/10.1007/11572961_19openalex-snapshot
Embedding of Cycles in the Faulty Hypercube
inferred← citeshttps://doi.org/10.1007/11572961_41openalex-snapshot
The Star-Pyramid Graph: An Attractive Alternative to the Pyramid
inferred← citeshttps://doi.org/10.1007/11859802_32openalex-snapshot
Fault-Free Pairwise Independent Hamiltonian Paths on Faulty Hypercubes
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/s00224-008-9108-zopenalex-snapshot
Fault-Tolerant Embedding of Pairwise Independent Hamiltonian Paths on a Faulty Hypercube with Edge Faults
inferred← citeshttps://doi.org/10.1007/s10114-010-8383-1openalex-snapshot
Panconnectivity for interconnection networks with faulty elements
inferred← citeshttps://doi.org/10.1007/s10878-006-9018-4openalex-snapshot
Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
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/s11227-007-0128-2openalex-snapshot
Perfect load balancing on the star interconnection network
inferred← citeshttps://doi.org/10.1007/s11227-008-0242-9openalex-snapshot
Optimal fault-tolerant Hamiltonicity of star graphs with conditional edge faults
inferred← citeshttps://doi.org/10.1007/s11227-009-0316-3openalex-snapshot
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
inferred← citeshttps://doi.org/10.1007/s11227-023-05674-6openalex-snapshot
Hamiltonian cycle embedding with fault-tolerant edges and adaptive diagnosis in half hypercube
inferred← citeshttps://doi.org/10.1007/s11464-009-0017-5openalex-snapshot
Survey on path and cycle embedding in some networks
inferred← citeshttps://doi.org/10.1016/j.amc.2005.11.023openalex-snapshot
A recursively construction scheme for super fault-tolerant hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2007.08.010openalex-snapshot
Fault-tolerant cycle-embedding in alternating group graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2008.10.040openalex-snapshot
Path embedding in star graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2008.10.061openalex-snapshot
Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.amc.2009.10.051openalex-snapshot
Cycle embedding in star graphs with conditional edge faults
inferred← citeshttps://doi.org/10.1016/j.amc.2010.05.038openalex-snapshot
Embedding cycles of various lengths into star graphs with both edge and vertex faults
inferred← citeshttps://doi.org/10.1016/j.amc.2011.09.033openalex-snapshot
Cycle embedding in star graphs with more conditional faulty edges
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.2020.04.009openalex-snapshot
Structure connectivity and substructure connectivity of star graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2008.08.007openalex-snapshot
Some topological properties of star graphs: The surface area and volume
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.03.029openalex-snapshot
Properties of a hierarchical network based on the star graph
inferred← citeshttps://doi.org/10.1016/j.ins.2014.06.046openalex-snapshot
Edge-fault-tolerant pancyclicity of arrangement graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2015.09.029openalex-snapshot
Fault-tolerant edge-bipancyclicity of faulty hypercubes under the conditional-fault model
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.05.012openalex-snapshot
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.02.012openalex-snapshot
Fault-tolerant pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.08.004openalex-snapshot
Longest paths and cycles in faulty star graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2005.10.004openalex-snapshot
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.04.004openalex-snapshot
Optimal fault-tolerant embedding of paths in twisted cubes
inferred← citeshttps://doi.org/10.1016/j.parco.2003.12.003openalex-snapshot
Pancyclicity on Möbius cubes with maximal edge faults
inferred← citeshttps://doi.org/10.1016/j.parco.2005.09.003openalex-snapshot
Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges
inferred← citeshttps://doi.org/10.1016/j.parco.2006.11.008openalex-snapshot
Panconnectivity and edge-fault-tolerant pancyclicity of augmented cubes
inferred← citeshttps://doi.org/10.1016/j.parco.2007.02.007openalex-snapshot
Conditional fault-tolerant hamiltonicity of star graphs
inferred← citeshttps://doi.org/10.1016/j.sysarc.2004.11.005openalex-snapshot
A generalized fault-tolerant sorting algorithm on a product network
inferred← citeshttps://doi.org/10.1016/j.sysarc.2006.10.008openalex-snapshot
Highly fault-tolerant cycle embeddings of hypercubes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.018openalex-snapshot
Embedding longest fault-free paths onto star graphs with more vertex faults
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.09.006openalex-snapshot
Edge-bipancyclicity of star graphs with faulty elements
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00141-6openalex-snapshot
Honeycomb tori are Hamiltonian
inferred← citeshttps://doi.org/10.1016/s0020-0255(01)00121-9openalex-snapshot
Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
inferred← citeshttps://doi.org/10.1016/s0096-3003(02)00933-5openalex-snapshot
On some super fault-tolerant Hamiltonian graphs
inferred← citeshttps://doi.org/10.1016/s0167-8191(03)00058-9openalex-snapshot
Fault-tolerant cycle embedding in the hypercube
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00190-0openalex-snapshot
Longest fault-free paths in star graphs with vertex faults
inferred← citeshttps://doi.org/10.1016/s1383-7621(00)00041-2openalex-snapshot
Congestion-free embedding of 2(n−k) spanning trees in an arrangement graph
inferred← citeshttps://doi.org/10.1080/00207160.2014.953942openalex-snapshot
Edge-fault-tolerant bipancyclicity of Cayley graphs generated by transposition-generating trees
inferred← citeshttps://doi.org/10.1080/00207160108805039openalex-snapshot
Stability measures of some static interconnection networks
inferred← citeshttps://doi.org/10.1080/00207160701619200openalex-snapshot
Largest connected component of a star graph with faulty vertices
inferred← citeshttps://doi.org/10.1080/00207161003786614openalex-snapshot
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
inferred← citeshttps://doi.org/10.1080/02286203.2007.11442408openalex-snapshot
Virtual Net: An Efficient Simulation for Parallel Computation
inferred← citeshttps://doi.org/10.1109/12.902755openalex-snapshot
Optimally balanced spanning tree of the star network
inferred← citeshttps://doi.org/10.1109/12.954510openalex-snapshot
Longest fault-free paths in star graphs with edge faults
inferred← citeshttps://doi.org/10.1109/71.910874openalex-snapshot
Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method
inferred← citeshttps://doi.org/10.1109/eiis.2017.8298665openalex-snapshot
The h-extra connectivity of the star graph Networks
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228259openalex-snapshot
Efficient algorithms to embed Hamiltonian Paths and Cycles in faulty crossed cubes
inferred← citeshttps://doi.org/10.1109/icicic.2006.277openalex-snapshot
Fault-Tolerant Mutually Independent Hamiltonian Cycles Embedding on Hypercubes
inferred← citeshttps://doi.org/10.1109/icnp.2001.992755openalex-snapshot
Distributed token circulation on mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/icpads.1998.741097openalex-snapshot
Congestion-free embedding of multiple spanning trees in an arrangement graph
inferred← citeshttps://doi.org/10.1109/icpads.2000.857701openalex-snapshot
Multi-node broadcasting in an arrangement graph using multiple spanning trees
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183370openalex-snapshot
Cycle embedding in a faulty hypercube
inferred← citeshttps://doi.org/10.1109/icpads.2002.1183445openalex-snapshot
On the fault-tolerant pancyclicity of crossed cubes
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/icpads.2007.4447776openalex-snapshot
Conditional edge-fault-tolerant Hamiltonian cycle embedding of star graphs
inferred← citeshttps://doi.org/10.1109/icpp.1998.708473openalex-snapshot
Embed longest rings onto star graphs with vertex faults
inferred← citeshttps://doi.org/10.1109/icpp.2001.952043openalex-snapshot
A mathematical game and its applications to the design of interconnection networks
inferred← citeshttps://doi.org/10.1109/ipdps.2001.925019openalex-snapshot
On the VLSI area and bisection width of star graphs and hierarchical cubic networks
inferred← citeshttps://doi.org/10.1109/ipdps.2005.223openalex-snapshot
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks
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/ispa.2010.90openalex-snapshot
Super Fault-Tolerant Hamiltonicity of Product Networks
inferred← citeshttps://doi.org/10.1109/ispan.2002.1004279openalex-snapshot
Embedding Hamiltonian paths and Hamiltonian cycles in faulty pancake graphs
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300476openalex-snapshot
Pancyclicity on Mobius cubes with edge faults
inferred← citeshttps://doi.org/10.1109/ispan.2005.41openalex-snapshot
Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs
inferred← citeshttps://doi.org/10.1109/ispan.2005.63openalex-snapshot
On Some Combinatorial Properties of the Star Graph
inferred← citeshttps://doi.org/10.1109/pdcat.2003.1236261openalex-snapshot
Fault-tolerant cycle embedding in dual-cube with node faulty
inferred← citeshttps://doi.org/10.1109/pdcat.2006.45openalex-snapshot
Conditional Fault-Tolerant Hamiltonicity of Star Graphs
inferred← citeshttps://doi.org/10.1109/pdcat.2009.29openalex-snapshot
Conditional Fault-Tolerant Cycle Embedding of Star Graphs
inferred← citeshttps://doi.org/10.1109/tc.2004.1255789openalex-snapshot
Fault Hamiltonicity and fault Hamiltonian connectivity of the arrangement graphs
inferred← citeshttps://doi.org/10.1109/tc.2006.104openalex-snapshot
Hamiltonian path embedding and pancyclicity on the Mobius cube with faulty nodes and faulty edges
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/tcomm.2011.093011.100321openalex-snapshot
Fault-Tolerant Bipancyclicity of Faulty Hypercubes Under the Generalized Conditional-Fault Model
inferred← citeshttps://doi.org/10.1109/tetc.2024.3387119openalex-snapshot
LP-Star: Embedding Longest Paths into Star Networks With Large-Scale Missing Edges Under an Emerging Assessment Model
inferred← citeshttps://doi.org/10.1109/tmc.2005.25openalex-snapshot
Distributed token circulation in mobile ad hoc networks
inferred← citeshttps://doi.org/10.1109/tpds.2005.151openalex-snapshot
Optimal path embedding in crossed cubes
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.108openalex-snapshot
Detecting Threats in Star Graphs
inferred← citeshttps://doi.org/10.1109/tpds.2008.123openalex-snapshot
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
inferred← citeshttps://doi.org/10.1109/tr.2009.2034286openalex-snapshot
Extended Fault-Tolerant Cycle Embedding in Faulty Hypercubes
inferred← citeshttps://doi.org/10.1109/tr.2025.3617497openalex-snapshot
Assessing Embedding Capability of Arrangement Graphs From the Perspectives of Partitioned Edge Faults
inferred← citeshttps://doi.org/10.1142/s0129626499000517openalex-snapshot
FAULT-TOLERANT RING EMBEDDING IN A HONEYCOMB TORUS WITH NODE FAILURES
inferred← citeshttps://doi.org/10.1142/s0219265909002558openalex-snapshot
FAULT-TOLERANT HAMILTONIAN LACEABILITY AND FAULT-TOLERANT CONDITIONAL HAMILTONIAN FOR BIPARTITE HYPERCUBE-LIKE NETWORKS
inferred← citeshttps://doi.org/10.1145/371209.371541openalex-snapshot
Embedding Hamiltonian paths in faulty arrangement graphs with the backtracking method
inferred← citeshttps://doi.org/10.1504/ijhpcn.2005.007866openalex-snapshot
Fault-tolerant cycle embedding in dual-cube with node faults
inferred← citeshttps://doi.org/10.1587/transfun.e97.a.1187openalex-snapshot
Longest Fault-Free Cycles in Folded Hypercubes with Conditional Faulty Elements
inferred← citeshttps://doi.org/10.19026/rjaset.11.1708openalex-snapshot
Fault Tolerance in Interconnection Network-a Survey
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.