On the public citation graph

Connectivity of minimal Cayley graphs

https://doi.org/10.1007/bf01234384
0 signed · 29 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/bf01220924openalex-snapshot
�ber den Zusammenhang symmetrischer Graphen
inferredcites →https://doi.org/10.1007/bf01222585openalex-snapshot
Eine Eigenschaft der Atome endlicher Graphen
inferredcites →https://doi.org/10.1007/bf01534633openalex-snapshot
On the connectivities of finite and infinite graphs
inferredcites →https://doi.org/10.1016/0095-8956(79)90007-8openalex-snapshot
On the connectivity of cayley graphs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80005-9openalex-snapshot
Connectivity of transitive graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-54029-6_192openalex-snapshot
On the fault-tolerance of quasi-minimal cayley networks
inferred← citeshttps://doi.org/10.1007/978-1-4613-0163-9_3openalex-snapshot
Transitive Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4757-2491-2_2openalex-snapshot
Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
inferred← citeshttps://doi.org/10.1007/bf02011193openalex-snapshot
Infinite circulants and their properties
inferred← citeshttps://doi.org/10.1007/s00026-007-0312-3openalex-snapshot
Fault Tolerance of Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s002240000129openalex-snapshot
An Isoperimetric Problem in Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s00373-014-1437-xopenalex-snapshot
Restricted Connectivity for Some Interconnection Networks
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90217-6openalex-snapshot
Connectivite des graphes de cayley abeliens sans K4
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00105-6openalex-snapshot
Small cutsets in quasiminimal Cayley graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90138-zopenalex-snapshot
The connectivity of hierarchical Cayley digraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104108openalex-snapshot
Coloring minimal Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.ins.2010.05.011openalex-snapshot
Roughness in Cayley graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(84)80034-7openalex-snapshot
On the Connectivity of Cayley Digraphs
inferred← citeshttps://doi.org/10.1023/a:1019135804943openalex-snapshot
Removing edges from hypercubes to obtain vertex‐symmetric networks with small diameter
inferred← citeshttps://doi.org/10.1109/12.166612openalex-snapshot
Cayley graphs with optimal fault tolerance
inferred← citeshttps://doi.org/10.1109/icpp.1998.708457openalex-snapshot
Pancake problems with restricted prefix reversals and some corresponding Cayley networks
inferred← citeshttps://doi.org/10.1142/s0129054198000052openalex-snapshot
THE CUBE-OF-RINGS INTERCONNECTION NETWORK
inferred← citeshttps://doi.org/10.1142/s1793830922501804openalex-snapshot
Application of near approximations in Cayley graphs
inferred← citeshttps://doi.org/10.1145/1376616.1376646openalex-snapshot
Paths to stardom
inferred← citeshttps://doi.org/10.22342/jims.26.3.681.275-285openalex-snapshot
On A Rough Cayley Graph Related to Conjugacy Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1703.08109openalex-snapshot
Cayley graphs and symmetric interconnection networks
inferred← citeshttps://doi.org/10.48550/arxiv.2009.05922openalex-snapshot
An algorithm for finding minimal generating sets of finite groups
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94338openalex-snapshot
Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks
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.