On the public citation graph

On graphical regular representations of Cn × Q

https://doi.org/10.1007/bfb0067383
0 signed · 21 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/bf01298284openalex-snapshot
On graphical regular representations of direct products of groups
inferredcites →https://doi.org/10.1007/bf01304186openalex-snapshot
Vertex-transitive graphs
inferredcites →https://doi.org/10.1007/bf01837731openalex-snapshot
Graphical regular representations of alternating, symmetric, and miscellaneous small groups
inferredcites →https://doi.org/10.1016/0095-8956(71)90019-0openalex-snapshot
On the action of non-Abelian groups on graphs
inferredcites →https://doi.org/10.1016/s0021-9800(68)80086-9openalex-snapshot
On the non-existence of graphs with transitive generalized dicyclic groups
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0097068-7openalex-snapshot
On a Class of Fixed-Point-Free Graphs
inferredcites →https://doi.org/10.4153/cjm-1972-101-5openalex-snapshot
Graphical Regular Representations of Non-Abelian Groups, I

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.20504openalex-snapshot
The graphical complexity of direct products of permutation groups
inferred← citeshttps://doi.org/10.1007/bf01837731openalex-snapshot
Graphical regular representations of alternating, symmetric, and miscellaneous small groups
inferred← citeshttps://doi.org/10.1007/bfb0062521openalex-snapshot
On the cayley index of a group
inferred← citeshttps://doi.org/10.1007/s00373-019-02096-1openalex-snapshot
Cyclic Permutation Groups that are Automorphism Groups of Graphs
inferred← citeshttps://doi.org/10.1007/s10801-018-0814-6openalex-snapshot
Graphical Frobenius representations
inferred← citeshttps://doi.org/10.1007/s10801-020-00956-1openalex-snapshot
Cayley graphs with few automorphisms
inferred← citeshttps://doi.org/10.1007/s10801-020-00964-1openalex-snapshot
Vertex-minimal planar graphs with cyclic 2-group symmetry
inferred← citeshttps://doi.org/10.1007/s10801-020-00975-yopenalex-snapshot
Vertex-minimal graphs with nonabelian $${\mathbf{2}}$$-group symmetry
inferred← citeshttps://doi.org/10.1016/j.disc.2014.08.006openalex-snapshot
Graphical cyclic permutation groups
inferred← citeshttps://doi.org/10.1016/j.disc.2017.06.019openalex-snapshot
Vertex-minimal graphs with dihedral symmetry I
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111913openalex-snapshot
A conjecture on bipartite graphical regular representations
inferred← citeshttps://doi.org/10.1070/sm1975v027n04abeh002524openalex-snapshot
FREE PRODUCTS OF NETWORKS AND FREE SYMMETRIZERS OF GRAPHS
inferred← citeshttps://doi.org/10.1201/b16132-37openalex-snapshot
Automorphisms
inferred← citeshttps://doi.org/10.26493/1855-3974.1498.77bopenalex-snapshot
Direct product of automorphism groups of digraphs
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.