On the public citation graph
The k‐degree Cayley graph and its topological properties
0 signed · 41 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/(sici)1097-0037(200001)35:1<56::aid-net5>3.0.co;2-dopenalex-snapshot
Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
inferredcites →https://doi.org/10.1002/mana.19600220107openalex-snapshot
In abstrakten Graphen vorhandene vollständige 4‐Graphen und ihre Unterteilungen
inferredcites →https://doi.org/10.1007/978-1-4757-3387-7openalex-snapshot
Topological Structure and Analysis of Interconnection Networks
inferredcites →https://doi.org/10.1016/0020-0190(92)90030-yopenalex-snapshot
Arrangement graphs: a class of generalized star graphs
inferredcites →https://doi.org/10.1016/0020-0190(95)00068-nopenalex-snapshot
Trivalent Cayley graphs for interconnection networks
inferredcites →https://doi.org/10.1016/0020-0190(96)00004-xopenalex-snapshot
Shortest routing in trivalent Cayley graph network
inferredcites →https://doi.org/10.1016/0743-7315(86)90010-9openalex-snapshot
A design methodology for synthesizing parallel algorithms and architectures
inferredcites →https://doi.org/10.1016/s0020-0190(96)00158-5openalex-snapshot
Hamilton cycles in Trivalent Cayley graphs
inferredcites →https://doi.org/10.1016/s0020-0190(99)00123-4openalex-snapshot
The correct diameter of trivalent Cayley 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.21149openalex-snapshot
The de Bruijn multiprocessor network: a versatile parallel processing and sorting network for VLSI
inferredcites →https://doi.org/10.1109/71.205649openalex-snapshot
Fibonacci cubes-a new interconnection Topology
inferredcites →https://doi.org/10.1109/71.250115openalex-snapshot
dBCube: a new class of hierarchical multiprocessor interconnection networks with area efficient layout
inferredcites →https://doi.org/10.1109/71.262585openalex-snapshot
The hierarchical hypercube: a new interconnection topology for massively parallel systems
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.1109/71.485505openalex-snapshot
Folded Petersen cube networks: new competitors for the hypercubes
inferredcites →https://doi.org/10.1109/71.640022openalex-snapshot
Comments on "A new family of Cayley graph interconnection networks of constant degree four"
inferredcites →https://doi.org/10.1109/71.737700openalex-snapshot
Cyclic-cubes: a new family of interconnection networks of even fixed-degrees
inferredcites →https://doi.org/10.1109/tc.1984.1676437openalex-snapshot
Generalized Hypercube and Hyperbus Structures for a Computer Network
inferredcites →https://doi.org/10.1109/tc.1987.5009497openalex-snapshot
Hypernet: A Communication-Efficient Architecture for Constructing Massively Parallel Computers
inferredcites →https://doi.org/10.1137/0219037openalex-snapshot
Group Action Graphs and Parallel Architectures
inferredcites →https://doi.org/10.1145/358645.358660openalex-snapshot
The cube-connected cycles: a versatile network for parallel computation
inferredcites →https://doi.org/10.1145/7531.7919openalex-snapshot
Electing a leader in a synchronous ring
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.20302openalex-snapshot
A note on the k‐degree Cayley graph
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.1007/s11227-013-0922-yopenalex-snapshot
TM: a new and simple topology for interconnection networks
inferred← citeshttps://doi.org/10.1016/j.aml.2009.01.056openalex-snapshot
On the isoperimetric number of a k -degree Cayley graph
inferred← citeshttps://doi.org/10.1016/j.asej.2025.103922openalex-snapshot
Fault-tolerant basis and fault-tolerant edge basis of three classes of French windmill graphs
inferred← citeshttps://doi.org/10.1016/j.proeng.2011.08.533openalex-snapshot
Modeling Several Multistage Interconnection Networks with Unified Cayley Formulation
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.06.001openalex-snapshot
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.023openalex-snapshot
On the construction of all shortest vertex-disjoint paths in Cayley graphs of abelian groups
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.028openalex-snapshot
RVCCC: A new variational network of cube-connected cycles and its topological properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114610openalex-snapshot
The diameter of rectangular twisted torus
inferred← citeshttps://doi.org/10.1080/17445760.2020.1799204openalex-snapshot
Super extra edge-connectivity in regular networks with edge faults
inferred← citeshttps://doi.org/10.1109/access.2020.3014883openalex-snapshot
Fault-Tolerant Metric Dimension of Interconnection Networks
inferred← citeshttps://doi.org/10.1109/tc.2014.2304391openalex-snapshot
Symmetric Property and Reliability of Balanced Hypercube
inferred← citeshttps://doi.org/10.1109/tpds.2014.2307853openalex-snapshot
Topological Properties on the Wide and Fault Diameters of Exchanged Hypercubes
inferred← citeshttps://doi.org/10.3390/math13111836openalex-snapshot
The Connectivity of DVcube Networks: A Survey
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.