On the public citation graph
Vosperian and superconnected Abelian Cayley digraphs
0 signed · 34 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/jgt.3190080406openalex-snapshot
Circulants and their connectivities
inferredcites →https://doi.org/10.1007/bf02546525openalex-snapshot
On small sumsets in an abelian group
inferredcites →https://doi.org/10.1016/s0012-365x(85)80010-8openalex-snapshot
Sur la separation dans les graphes de Cayley abeliens
inferredcites →https://doi.org/10.1016/s0195-6698(84)80034-7openalex-snapshot
On the Connectivity of Cayley Digraphs
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.20521openalex-snapshot
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
inferred← citeshttps://doi.org/10.1002/net.20440openalex-snapshot
Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions
inferred← citeshttps://doi.org/10.1006/eujc.1995.0113openalex-snapshot
Subsets with Small Sums in Abelian Groups' I: the Vosper Property
inferred← citeshttps://doi.org/10.1006/eujc.1999.0340openalex-snapshot
Subsets with a Small Sum II: the Critical Pair Problem
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-94-015-8937-6_5openalex-snapshot
Cayley graphs and interconnection networks
inferred← citeshttps://doi.org/10.1007/bf01929482openalex-snapshot
Minimum order of loop networks of given degree and girth
inferred← citeshttps://doi.org/10.1007/s00373-007-0725-0openalex-snapshot
Super-Connectivity and Hyper-Connectivity of Vertex Transitive Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1104-4openalex-snapshot
On Vosperian and Superconnected Vertex-Transitive Digraphs
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(95)98134-mopenalex-snapshot
An algebraic analysis of the connectivity of DeBruijn and shuffle-exchange digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2008.08.018openalex-snapshot
Super-connected arc-transitive digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2010.02.004openalex-snapshot
Double-super-connected digraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.02.006openalex-snapshot
Restricted arc-connectivity of generalized p -cycles
inferred← citeshttps://doi.org/10.1016/j.dam.2013.02.005openalex-snapshot
Small cutsets in arc-transitive digraphs of prime degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.05.005openalex-snapshot
Yahya Ould Hamidoune’s mathematical journey: A critical review of his work
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00383-1openalex-snapshot
On the superconnectivity of generalized p-cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00133-xopenalex-snapshot
Number of minimum vertex cuts in transitive graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00314-7openalex-snapshot
On the order and size of s-geodetic digraphs with given connectivity
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00079-4openalex-snapshot
Super line-connectivity of consecutive-d digraphs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00391-8openalex-snapshot
Connectivity of vertex and edge transitive graphs
inferred← citeshttps://doi.org/10.1017/s0963548307008620openalex-snapshot
On Iterated Image Size for Point-Symmetric Relations
inferred← citeshttps://doi.org/10.1109/spdp.1993.395485openalex-snapshot
Fault-tolerance properties of deBruijn and shuffle-exchange networks
inferred← citeshttps://doi.org/10.1112/s0025579300000966openalex-snapshot
A Step Beyond Kemperman's Structure Theorem
inferred← citeshttps://doi.org/10.1137/s0895480196288644openalex-snapshot
Cayley Digraphs Based on the de Bruijn Networks
inferred← citeshttps://doi.org/10.1142/s0129054111008994openalex-snapshot
LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
inferred← citeshttps://doi.org/10.48550/arxiv.0706.0635openalex-snapshot
Some additive applications of the isopermetric approach
inferred← citeshttps://doi.org/10.5802/aif.2404openalex-snapshot
Some additive applications of the isoperimetric approach
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93142openalex-snapshot
Recubrimientos k-arco transitivos de digrafos
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.