On the public citation graph

On graphical regular representations of direct products of groups

https://doi.org/10.1007/bf01298284
0 signed · 23 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/bf01162967openalex-snapshot
Graph multiplication
inferredcites →https://doi.org/10.1007/bf01304186openalex-snapshot
Vertex-transitive graphs
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.1090/s0002-9939-1964-0159321-0openalex-snapshot
On a Theorem of Sabidussi
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.20385openalex-snapshot
Direct products of automorphism groups of graphs
inferred← citeshttps://doi.org/10.1002/jgt.20504openalex-snapshot
The graphical complexity of direct products of permutation groups
inferred← citeshttps://doi.org/10.1007/bf02789317openalex-snapshot
On products of graphs and regular groups
inferred← citeshttps://doi.org/10.1007/bfb0067383openalex-snapshot
On graphical regular representations of Cn × Q
inferred← citeshttps://doi.org/10.1007/s10231-021-01163-wopenalex-snapshot
On the asymptotic enumeration of Cayley graphs
inferred← citeshttps://doi.org/10.1007/s11856-021-2150-0openalex-snapshot
Asymptotic enumeration of Cayley digraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90027-8openalex-snapshot
On graphical regular representations of direct products of groups
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111913openalex-snapshot
A conjecture on bipartite graphical regular representations
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112078openalex-snapshot
Corrigendum to “A conjecture on bipartite graphical regular representations” [Discrete Math. 343 (8) (2020) 111913]
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.10.003openalex-snapshot
On the existence of graphical Frobenius representations and their asymptotic enumeration
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00104-2openalex-snapshot
On quasiabelian Cayley graphs and graphical doubly regular representations
inferred← citeshttps://doi.org/10.2140/pjm.1974.55.461openalex-snapshot
On graphical regular representations of cyclic extensions of groups
inferred← citeshttps://doi.org/10.26493/1855-3974.1498.77bopenalex-snapshot
Direct product of automorphism groups of digraphs
inferred← citeshttps://doi.org/10.26493/1855-3974.1926.6adopenalex-snapshot
Decompositions of the automorphism groups of edge-colored graphs into the direct product of permutation groups
inferred← citeshttps://doi.org/10.26493/2590-9770.1338.0b2openalex-snapshot
On the equivalence between a conjecture of Babai-Godsil and a conjecture of Xu concerning the enumeration of Cayley graphs
inferred← citeshttps://doi.org/10.4153/s0008414x23000093openalex-snapshot
Finite transitive groups having many suborbits of cardinality at most 2 and an application to the enumeration of Cayley graphs
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.