On the public citation graph
Graphs, groups and polytopes
0 signed · 26 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.1007/978-3-662-21946-1openalex-snapshot
Generators and Relations for Discrete Groups
inferredcites →https://doi.org/10.1137/1007139openalex-snapshot
Generators and Relations for Discrete Groups, second edition (H. S. M. Coxeter and W. O. J. Moser)
inferredcites →https://doi.org/10.2307/2003966openalex-snapshot
Generators and Relations for Discrete Groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-94-015-8937-6_3openalex-snapshot
Symmetry and eigenvectors
inferred← citeshttps://doi.org/10.1007/bf02189090openalex-snapshot
Bounding the diameter of distance-regular graphs
inferred← citeshttps://doi.org/10.1007/s00022-014-0214-6openalex-snapshot
A new upper bound for constant distance codes of generators on hermitian polar spaces of type H(2d − 1, q 2)
inferred← citeshttps://doi.org/10.1007/s10107-022-01861-0openalex-snapshot
Graphical designs and gale duality
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
inferred← citeshttps://doi.org/10.1016/j.disc.2009.03.034openalex-snapshot
The local spectra of regular line graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.015openalex-snapshot
The Local Spectra of Line Graphs
inferred← citeshttps://doi.org/10.1016/s0024-3795(00)00245-7openalex-snapshot
On pseudo-distance-regularity
inferred← citeshttps://doi.org/10.1017/cbo9781316414958openalex-snapshot
Erdős–Ko–Rado Theorems: Algebraic Approaches
inferred← citeshttps://doi.org/10.1080/03081088808817894openalex-snapshot
Semiregular graphs and their algebra
inferred← citeshttps://doi.org/10.1137/0609035openalex-snapshot
Eigenvectors of Distance-Regular Graphs
inferred← citeshttps://doi.org/10.1137/22m1504421openalex-snapshot
Extremal Graph Realizations and Graph Laplacian Eigenvalues
inferred← citeshttps://doi.org/10.1137/22m1528768openalex-snapshot
Eigenpolytope Universality and Graphical Designs
inferred← citeshttps://doi.org/10.1145/2554797.2554830openalex-snapshot
On the automorphism groups of strongly regular graphs I
inferred← citeshttps://doi.org/10.22199/s07160917.1992.0001.00002openalex-snapshot
Spectra of related graphs and self-reproducing polyhedra
inferred← citeshttps://doi.org/10.26493/1855-3974.2712.6beopenalex-snapshot
The edge-transitive polytopes that are not vertex-transitive
inferred← citeshttps://doi.org/10.4153/cjm-1998-040-8openalex-snapshot
Eigenpolytopes of Distance Regular 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.