On the public citation graph
Transposition networks as a class of fault-tolerant robust networks
0 signed · 64 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.1016/0020-0190(93)90060-mopenalex-snapshot
On the fault-diameter of the star graph
inferredcites →https://doi.org/10.1016/0167-8191(93)90054-oopenalex-snapshot
Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
inferredcites →https://doi.org/10.1016/0898-1221(93)90188-2openalex-snapshot
Topological properties of star graphs
inferredcites →https://doi.org/10.1049/ip-e.1991.0054openalex-snapshot
Simulation of PM21 network by folded hypercube
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.2194openalex-snapshot
Flip-trees: fault-tolerant graphs with wide containers
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.282562openalex-snapshot
A parallel algorithm for computing Fourier transforms on the star graph
inferredcites →https://doi.org/10.1109/ftcs.1993.627329openalex-snapshot
Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
inferredcites →https://doi.org/10.1109/icdcs.1991.148730openalex-snapshot
Super Star: a new optimally fault tolerant network architecture
inferredcites →https://doi.org/10.1109/icpads.2002.1183375openalex-snapshot
A novel neighbourhood broadcasting algorithm on star graphs
inferredcites →https://doi.org/10.1109/icpp.1993.171openalex-snapshot
System-Level Diagnosis Strategies for n-star Multiprocessor Systems
inferredcites →https://doi.org/10.1109/icpp.1994.60openalex-snapshot
Analysis of Interconnection Networks Based on Cayley Graphs of Strong Generating Sets
inferredcites →https://doi.org/10.1109/spdp.1990.143600openalex-snapshot
Embedding of cycles and grids in star graphs
inferredcites →https://doi.org/10.1142/s0129054197000112openalex-snapshot
Fault Tolerance on Star Graphs
inferredcites →https://doi.org/10.1142/s0129626491000203openalex-snapshot
SUBCUBE EMBEDDABILITY OF FOLDED HYPERCUBES
inferredcites →https://doi.org/10.1142/s0218126691000215openalex-snapshot
EMBEDDING OF CYCLES AND GRIDS IN STAR GRAPHS
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
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.20126openalex-snapshot
Hyper hamiltonian laceability of Cayley graphs generated by transpositions
inferred← citeshttps://doi.org/10.1002/net.20356openalex-snapshot
Polynomial time algorithm for constructing vertex-disjoint paths in transposition graphs
inferred← citeshttps://doi.org/10.1002/scj.20518openalex-snapshot
An algorithm for disjoint paths in bubble‐sort graphs
inferred← citeshttps://doi.org/10.1007/11572961_38openalex-snapshot
Matrix-Star Graphs: A New Interconnection Network Based on Matrix Operations
inferred← citeshttps://doi.org/10.1007/3-540-48387-x_16openalex-snapshot
Routing and Embeddings in Super Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-05375-7_23openalex-snapshot
On the Energy of Transposition Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-15672-4_12openalex-snapshot
Embedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-17458-2_19openalex-snapshot
The Number of Shortest Paths in the (n, k)-Star Graphs
inferred← citeshttps://doi.org/10.1007/s11227-011-0716-zopenalex-snapshot
Three-dimensional Petersen-torus network: a fixed-degree network for massively parallel computers
inferred← citeshttps://doi.org/10.1007/s11227-015-1473-1openalex-snapshot
An algorithm for sorting pancake by restricted reversals
inferred← citeshttps://doi.org/10.1016/j.amc.2016.12.015openalex-snapshot
A kind of conditional connectivity of Cayley graphs generated by wheel graphs
inferred← citeshttps://doi.org/10.1016/j.aml.2005.09.004openalex-snapshot
Distance distribution of nodes in star graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.006openalex-snapshot
The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
inferred← citeshttps://doi.org/10.1016/j.dam.2017.11.025openalex-snapshot
A kind of conditional connectivity of transposition networks generated by k -trees
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.040openalex-snapshot
Reliability analysis of Cayley graphs generated by transpositions
inferred← citeshttps://doi.org/10.1016/j.dam.2022.04.017openalex-snapshot
On oriented diameter of (n,k) -star graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2013.03.035openalex-snapshot
The number of shortest paths in the arrangement graph
inferred← citeshttps://doi.org/10.1016/j.ins.2014.10.032openalex-snapshot
Some conditional vertex connectivities of complete-transposition graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.025openalex-snapshot
Data center interconnection networks are not hyperbolic
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115421openalex-snapshot
Subnetwork reliability analysis about complete-transposition graph networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00133-1openalex-snapshot
VLSI layouts of complete graphs and star graphs
inferred← citeshttps://doi.org/10.1093/ietisy/e89-d.10.2600openalex-snapshot
Node-Disjoint Paths Algorithm in a Transposition Graph
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.4.1003openalex-snapshot
The Container Problem in Bubble-Sort Graphs
inferred← citeshttps://doi.org/10.1109/71.730528openalex-snapshot
Macro-star networks: efficient low-degree alternatives to star graphs
inferred← citeshttps://doi.org/10.1109/access.2020.3014822openalex-snapshot
Constructing Independent Spanning Trees on Transposition Networks
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750613openalex-snapshot
Parallel algorithms on the rotation-exchange network-a trivalent variant of the star graph
inferred← citeshttps://doi.org/10.1109/iccmc.2017.8282701openalex-snapshot
Application of deep learning technique for automatic data exchange with air-gapped systems and its security concerns
inferred← citeshttps://doi.org/10.1109/icpp.2000.876069openalex-snapshot
Multilayer VLSI layout for interconnection networks
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/icpp.2003.1240602openalex-snapshot
Optimal layout for butterfly networks in multilayer VLSI
inferred← citeshttps://doi.org/10.1109/infoseee.2014.6948077openalex-snapshot
On the embedding of edge-disjoint Hamiltonian cycles in transposition networks
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303034openalex-snapshot
Optimal layout for fast Fourier transform in multilayer VLSI
inferred← citeshttps://doi.org/10.1109/ipps.1999.760514openalex-snapshot
The recursive grid layout scheme for VLSI layout of hierarchical networks
inferred← citeshttps://doi.org/10.1109/jcsse.2011.5930128openalex-snapshot
Node-to-set disjoint paths in substring reversal graphs
inferred← citeshttps://doi.org/10.1109/prdc.2004.1276568openalex-snapshot
Node-to-node internally disjoint paths problem in bubble-sort graphs
inferred← citeshttps://doi.org/10.1142/s1793830914500517openalex-snapshot
The number of shortest paths in the (n, k)-star graph
inferred← citeshttps://doi.org/10.14257/ijseia.2016.10.3.17openalex-snapshot
Embedding Algorithm among Half Pancake, Pancake, and Star Graphs
inferred← citeshttps://doi.org/10.3390/s110201959openalex-snapshot
One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
inferred← citeshttps://doi.org/10.3745/kipsta.2011.18a.5.205openalex-snapshot
Twisted Cube Torus(TT): A New Class of Torus Interconnection Networks Based on 3-Dimensional Twisted Cube
inferred← citeshttps://doi.org/10.48550/arxiv.0806.3152openalex-snapshot
TRANS-Net: an Efficient Peer-to-Peer Overlay Network Based on a Full Transposition Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1708.02692openalex-snapshot
A kind of conditional connectivity of transposition networks generated by $k$-trees
inferred← citeshttps://doi.org/10.5391/jkiis.2014.24.4.430openalex-snapshot
One-to-One Mapping Algorithm between Matrix Star Graphs and Half Pancake Graphs
inferred← citeshttps://doi.org/10.6109/jkiice.2014.18.5.1110openalex-snapshot
An Algorithm for One-to-One Mapping Matrix-star Graph into Transposition Graph
inferred← citeshttps://doi.org/10.7151/dmgt.1903openalex-snapshot
Edge-transitivity of Cayley graphs generated by transpositions
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.