On the public citation graph

On the diameter and bisector size of Cayley graphs

https://doi.org/10.1007/bf01371728
0 signed · 36 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.1007/978-3-0346-0332-4openalex-snapshot
Discrete Groups, Expanding Graphs and Invariant Measures
inferredcites →https://doi.org/10.1007/bf02126799openalex-snapshot
Ramanujan graphs
inferredcites →https://doi.org/10.1007/bf02579338openalex-snapshot
Sorting inc logn parallel steps
inferredcites →https://doi.org/10.1007/bf02698687openalex-snapshot
Groups of polynomial growth and expanding maps (with an appendix by Jacques Tits)
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1016/s0195-6698(89)80067-8openalex-snapshot
Small-diameter Cayley Graphs for Finite Simple Groups
inferredcites →https://doi.org/10.1109/12.21148openalex-snapshot
A group-theoretic model for symmetric interconnection networks
inferredcites →https://doi.org/10.1109/dmcc.1991.633348openalex-snapshot
Processor-Time Tradeoffs for Cayley Graph Interconnection Networks
inferredcites →https://doi.org/10.1109/fscs.1990.89608openalex-snapshot
On the diameter of finite groups
inferredcites →https://doi.org/10.1109/sfcs.1989.63507openalex-snapshot
Expanders might be practical: fast algorithms for routing around faults on multibutterflies
inferredcites →https://doi.org/10.1109/tc.1985.1676627openalex-snapshot
Interconnection Networks Based on a Generalization of Cube-Connected Cycles
inferredcites →https://doi.org/10.1112/plms/s3-25.4.603openalex-snapshot
The Degree of Polynomial Growth of Finitely Generated Nilpotent Groups
inferredcites →https://doi.org/10.1137/0213011openalex-snapshot
Limitations on Explicit Constructions of Expanding Graphs
inferredcites →https://doi.org/10.1137/0219037openalex-snapshot
Group Action Graphs and Parallel Architectures
inferredcites →https://doi.org/10.1137/0401018openalex-snapshot
Wide-Sense Nonblocking Networks
inferredcites →https://doi.org/10.1145/103418.103440openalex-snapshot
Local expansion of vertex-transitive graphs and random generation in finite groups
inferredcites →https://doi.org/10.1145/113379.113388openalex-snapshot
An overview of supertoroidal networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jabr.1998.7502openalex-snapshot
Asymptotic Growth of Finite Groups
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_12openalex-snapshot
Edge-Bisection of Chordal Rings
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_1openalex-snapshot
Additive Group Theory Applied to Network Topology
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_61openalex-snapshot
Bisecting and Gossiping in Circulant Graphs
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
inferred← citeshttps://doi.org/10.1007/bf01192695openalex-snapshot
On Small Cuts Separating an Abelian Cayley Graph into Two Equal Parts
inferred← citeshttps://doi.org/10.1007/bf01301966openalex-snapshot
Node Bisectors of Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s00224-008-9105-2openalex-snapshot
Bounds on Mincut for Cayley Graphs over Abelian Groups
inferred← citeshttps://doi.org/10.1007/s00453-013-9810-3openalex-snapshot
Random Walks, Bisections and Gossiping in Circulant Graphs
inferred← citeshttps://doi.org/10.1007/s10013-023-00607-5openalex-snapshot
Bounds for the Diameters of Orbital Graphs of Affine Groups
inferred← citeshttps://doi.org/10.1016/j.disc.2008.07.039openalex-snapshot
Vertex reconstruction in Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.12.005openalex-snapshot
Diameters of Cayley graphs of Chevalley groups
inferred← citeshttps://doi.org/10.1016/j.laa.2008.05.010openalex-snapshot
Some problems on Cayley graphs
inferred← citeshttps://doi.org/10.1090/s0894-0347-2014-00821-3openalex-snapshot
Growth in finite simple groups of Lie type
inferred← citeshttps://doi.org/10.1137/s0895480100372899openalex-snapshot
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
inferred← citeshttps://doi.org/10.1137/s0895480195286456openalex-snapshot
Geometry and Diameter Bounds of Directed Cayley Graphs of Abelian Groups
inferred← citeshttps://doi.org/10.1515/forum.2009.002openalex-snapshot
Generating abelian groups by addition only
inferred← citeshttps://doi.org/10.48550/arxiv.math/0502221openalex-snapshot
Diameters of Cayley graphs of SL_n(Z/kZ)
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94035openalex-snapshot
Anells cordals:propietats estructurals i models de comunicacions
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.