On the public citation graph

Hyper hamiltonian laceability of Cayley graphs generated by transpositions

0 signed · 51 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.1002/1097-0037(200012)36:4<225::aid-net3>3.0.co;2-gopenalex-snapshot
Hamiltonian-laceability of star graphs
inferredcites →https://doi.org/10.1002/net.3230260304openalex-snapshot
Hamilton cycles and paths in butterfly graphs
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.1007/978-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
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/j.ins.2003.09.023openalex-snapshot
Hyper hamiltonian laceability on edge fault star graph
inferredcites →https://doi.org/10.1016/s0020-0190(02)00214-4openalex-snapshot
Fault-tolerant hamiltonian laceability of hypercubes
inferredcites →https://doi.org/10.1016/s0020-0190(97)00059-8openalex-snapshot
Node-to-set disjoint paths problem in star graphs
inferredcites →https://doi.org/10.1016/s0898-1221(97)00223-xopenalex-snapshot
Hyper-Hamilton Laceable and Caterpillar-Spannable Product Graphs
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/12.485375openalex-snapshot
Transposition networks as a class of fault-tolerant robust networks
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.553290openalex-snapshot
Optimal information dissemination in star and pancake networks
inferredcites →https://doi.org/10.1109/prdc.2004.1276568openalex-snapshot
Node-to-node internally disjoint paths problem in bubble-sort 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/jgt.22915openalex-snapshot
Star transposition Gray codes for multiset permutations
inferred← citeshttps://doi.org/10.1002/net.20187openalex-snapshot
Matching preclusion for some interconnection networks
inferred← citeshttps://doi.org/10.1007/s00373-012-1172-0openalex-snapshot
Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees
inferred← citeshttps://doi.org/10.1007/s00373-016-1741-8openalex-snapshot
On the Problem of Determining which (n, k)-Star Graphs are Cayley Graphs
inferred← citeshttps://doi.org/10.1016/j.camwa.2007.10.016openalex-snapshot
Orienting Cayley graphs generated by transposition 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.2021.07.022openalex-snapshot
Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions
inferred← citeshttps://doi.org/10.1016/j.dam.2025.08.061openalex-snapshot
k-edge-Hamilton-laceable bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2009.09.002openalex-snapshot
Bipancyclic properties of Cayley graphs generated by transpositions
inferred← citeshttps://doi.org/10.1016/j.disc.2011.07.027openalex-snapshot
Random induced subgraphs of Cayley graphs induced by transpositions
inferred← citeshttps://doi.org/10.1016/j.disc.2012.06.007openalex-snapshot
Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
inferred← citeshttps://doi.org/10.1016/j.ins.2007.05.034openalex-snapshot
Linearly many faults in Cayley graphs generated by transposition trees
inferred← citeshttps://doi.org/10.1016/j.ins.2011.05.010openalex-snapshot
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
inferred← citeshttps://doi.org/10.1016/j.ins.2013.03.009openalex-snapshot
Diagnosability of Cayley graphs generated by transposition trees with missing edges
inferred← citeshttps://doi.org/10.1016/j.mcm.2007.11.007openalex-snapshot
Hamiltonian connectivity of 2-tree-generated networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.01.020openalex-snapshot
Fault-tolerant Hamiltonian connectivity of 2-tree-generated networks
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/00207160802512700openalex-snapshot
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
inferred← citeshttps://doi.org/10.1080/00207160902883514openalex-snapshot
Matching preclusion for the (n, k)-bubble-sort graphs
inferred← citeshttps://doi.org/10.1080/17445760.2019.1618462openalex-snapshot
Component connectivity of Cayley graphs generated by transposition trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxab167openalex-snapshot
Fault-Tolerant Strongly Hamiltonian Laceability and Hyper-Hamiltonian Laceability of Cayley Graphs Generated by Transposition Trees
inferred← citeshttps://doi.org/10.1093/comjnl/bxac196openalex-snapshot
Hyper-Hamiltonian Laceability of Cartesian Products of Cycles and Paths
inferred← citeshttps://doi.org/10.1109/i-span.2012.16openalex-snapshot
Successive Generalizations of Star Graphs
inferred← citeshttps://doi.org/10.1142/s0129054107005108openalex-snapshot
FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
inferred← citeshttps://doi.org/10.1142/s0129054108006364openalex-snapshot
MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS
inferred← citeshttps://doi.org/10.1142/s0129054119500278openalex-snapshot
Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
inferred← citeshttps://doi.org/10.1142/s0129054121500349openalex-snapshot
The (E)FTSM-(edge) Connectivity of Cayley Graphs Generated by Transposition Trees
inferred← citeshttps://doi.org/10.1142/s0129626413500114openalex-snapshot
THE Qn,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS
inferred← citeshttps://doi.org/10.1142/s0218196723500571openalex-snapshot
Dead ends on wreath products and lamplighter groups
inferred← citeshttps://doi.org/10.1142/s0219265908002175openalex-snapshot
CONDITIONAL DIAGNOSABILITY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITION TREES UNDER THE COMPARISON DIAGNOSIS MODEL
inferred← citeshttps://doi.org/10.1142/s021926591650002xopenalex-snapshot
Edge Fault-Tolerant Strong Hamiltonian Laceability of Balanced Hypercubes
inferred← citeshttps://doi.org/10.1142/s1793830919300029openalex-snapshot
A survey on Hamiltonicity in Cayley graphs and digraphs on different groups
inferred← citeshttps://doi.org/10.26493/1855-3974.509.d9dopenalex-snapshot
Hamilton paths in Cayley graphs on Coxeter groups: I
inferred← citeshttps://doi.org/10.26493/2590-9770.1250.763openalex-snapshot
Cayley graphs of order kp are hamiltonian for k < 48
inferred← citeshttps://doi.org/10.3390/sym17060918openalex-snapshot
The Reliability of Cayley Graphs Generated by Transposition Trees Based on Edge Failures
inferred← citeshttps://doi.org/10.5614/ejgta.2021.9.1.16openalex-snapshot
Hyper-Hamiltonian circulants
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.