On the public citation graph

Asymmetrische reguläre Graphen

https://doi.org/10.1007/bf01894574
0 signed · 16 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/bf01319048openalex-snapshot
Regul�re Graphen beliebigen Grades mit vorgegebenen Eigenschaften
inferredcites →https://doi.org/10.1007/bf01895716openalex-snapshot
Asymmetric graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80018-8openalex-snapshot
Extrema concerning asymmetric graphs

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.23145openalex-snapshot
On oriented m $m$‐semiregular representations of finite groups
inferred← citeshttps://doi.org/10.1002/mana.19700460104openalex-snapshot
Über asymmetrische Graphen
inferred← citeshttps://doi.org/10.1007/bf01303660openalex-snapshot
�ber asymmetrische regul�re Graphen
inferred← citeshttps://doi.org/10.1007/bf01895984openalex-snapshot
Asymmetrische reguläre Graphen. II
inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105174openalex-snapshot
A classification of the graphical m-semiregular representation of finite groups
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106096openalex-snapshot
The existence of m-Haar graphical representations
inferred← citeshttps://doi.org/10.1016/s0095-8956(76)80012-3openalex-snapshot
A note on uniquely reducible graphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17775.xopenalex-snapshot
THE CONSTRUCTION OF MINIMAL‐LINE GRAPHS WITH GIVEN AUTOMORPHISM GROUP
inferred← citeshttps://doi.org/10.1155/2014/358792openalex-snapshot
Distance Degree Regular Graphs and Distance Degree Injective Graphs: An Overview
inferred← citeshttps://doi.org/10.13001/1081-3810.2986openalex-snapshot
Godsil-McKay switching and isomorphism
inferred← citeshttps://doi.org/10.4310/mrl.2016.v23.n1.a8openalex-snapshot
On the number of outer automorphisms of the automorphism group of a right-angled Artin group
inferred← citeshttps://doi.org/10.48550/arxiv.1305.3146openalex-snapshot
Discriminating Power of Centrality Measures
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07133openalex-snapshot
A classification of the m-graphical regular representation of finite groups
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.