On the public citation graph

Comments on "A new family of Cayley graph interconnection networks of constant degree four"

0 signed · 17 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.1109/71.481595openalex-snapshot
A new family of Cayley graph interconnection networks of constant degree four
inferredcites →https://doi.org/10.1137/0219037openalex-snapshot
Group Action Graphs and Parallel Architectures

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.10083openalex-snapshot
Cycle embedding in faulty wrapped butterfly graphs
inferred← citeshttps://doi.org/10.1002/net.20096openalex-snapshot
The k‐degree Cayley graph and its topological properties
inferred← citeshttps://doi.org/10.1007/s10586-011-0189-0openalex-snapshot
A new family of Cayley graph interconnection networks based on wreath product and its topological properties
inferred← citeshttps://doi.org/10.1016/j.dam.2008.01.009openalex-snapshot
The Independence Number for De Bruijn networks and Kautz networks
inferred← citeshttps://doi.org/10.1016/j.mcm.2008.08.014openalex-snapshot
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00074-0openalex-snapshot
Cyclic-cubes and wrap-around butterflies
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00138-6openalex-snapshot
A note on cyclic-cubes
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00073-xopenalex-snapshot
Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
inferred← citeshttps://doi.org/10.1109/71.819950openalex-snapshot
Isomorphism of degree four Cayley graph and wrapped butterfly and their optimal permutation routing algorithm
inferred← citeshttps://doi.org/10.1109/71.841753openalex-snapshot
Tighter layouts of the cube-connected cycles
inferred← citeshttps://doi.org/10.1109/aina.2003.1192881openalex-snapshot
Isomorphism of Cyclic Cubes and Bidi Shufflenet
inferred← citeshttps://doi.org/10.1109/hipc.1997.634524openalex-snapshot
A tight layout of the cube-connected cycles
inferred← citeshttps://doi.org/10.1137/s0097539799365462openalex-snapshot
Mapping Cycles and Trees on Wrap-Around Butterfly Graphs
inferred← citeshttps://doi.org/10.1142/s0129626416500055openalex-snapshot
On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks
inferred← citeshttps://doi.org/10.48550/arxiv.cond-mat/0502346openalex-snapshot
Cost-volume relationships for flows through a disordered network
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.