On the public citation graph

(v, k, ?)-Graphs and polarities of (v, k, ?)-designs

https://doi.org/10.1007/bf01117497
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.
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/978-3-642-62012-6openalex-snapshot
Finite Geometries
inferredcites →https://doi.org/10.1007/bf01110323openalex-snapshot
Polarit�ten von endlich erzeugten freien Ebenen
inferredcites →https://doi.org/10.1017/s144678870000776xopenalex-snapshot
On a combinatorial generalization of 27 lines associated with a cubic surface
inferredcites →https://doi.org/10.1349/ddlp.3362openalex-snapshot
Geometric permutation representations of finite symplectic, orthogonal, and unitary groups.
inferredcites →https://doi.org/10.2140/pjm.1956.6.83openalex-snapshot
On the number of absolute points of a correlation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.1562703openalex-extracted
Divisible Design Graphs
inferred← citeshttps://doi.org/10.2139/ssrn.1974443openalex-extracted
More About Divisible Design Graphs
inferred← citeshttps://doi.org/10.1002/jcd.3180010303openalex-snapshot
Symmetric (41,16,6)‐designs with a nontrivial automorphism of odd order
inferred← citeshttps://doi.org/10.1002/jgt.1026openalex-snapshot
Stability of arc‐transitive graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190120204openalex-snapshot
Exotic n‐universal graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-32808-5_4openalex-snapshot
The Paulus–Rozenfeld–Thompson Graph on 26 Vertices Revisited and Related Combinatorial Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-17729-8_4openalex-snapshot
Divisible Design Digraphs
inferred← citeshttps://doi.org/10.1007/bf01213827openalex-snapshot
Biplanes
inferred← citeshttps://doi.org/10.1007/bf01228287openalex-snapshot
Hyperovals and Hadamard designs
inferred← citeshttps://doi.org/10.1007/bf02125894openalex-snapshot
Non rank 3 strongly regular graphs with the 5-vertex condition
inferred← citeshttps://doi.org/10.1007/s00026-016-0334-9openalex-snapshot
On the Metric Dimension of Imprimitive Distance-Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00373-021-02440-4openalex-snapshot
New Constructions of Divisible Design Cayley Graphs
inferred← citeshttps://doi.org/10.1007/s10623-007-9041-1openalex-snapshot
A design and a geometry for the group Fi 22
inferred← citeshttps://doi.org/10.1007/s10623-013-9861-0openalex-snapshot
Walk-regular divisible design graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90057-6openalex-snapshot
Strongly regular graphs
inferred← citeshttps://doi.org/10.1016/0097-3165(73)90017-4openalex-snapshot
Combinatorial structures in loops I. Elements of the decomposition theory
inferred← citeshttps://doi.org/10.1016/0097-3165(76)90074-1openalex-snapshot
Ramsey graphs and block designs
inferred← citeshttps://doi.org/10.1016/0097-3165(89)90004-6openalex-snapshot
On (v, k, λ) graphs and designs with trivial automorphism group
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111784openalex-snapshot
Divisible design Cayley digraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112692openalex-snapshot
On WL-rank of Deza Cayley graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2008.12.005openalex-snapshot
Flag-transitive symmetric 2- ( 96 , 20 , 4 ) -designs
inferred← citeshttps://doi.org/10.1016/j.jcta.2010.10.003openalex-snapshot
Divisible design graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2025.106047openalex-snapshot
q-Analogs of divisible design graphs and Deza graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73325-5openalex-snapshot
A Class of Strongly Regular Graphs Related to Orthogonal Groups
inferred← citeshttps://doi.org/10.1017/s1446788700021637openalex-snapshot
Transposable and symmetrizable matrices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1975-0396317-xopenalex-snapshot
Ramsey Graphs and Block Designs. I
inferred← citeshttps://doi.org/10.37236/1710openalex-snapshot
Switching of Edges in Strongly Regular Graphs I: A Family of Partial Difference Sets on 100 Vertices
inferred← citeshttps://doi.org/10.48550/arxiv.1312.4971openalex-snapshot
On the metric dimension of imprimitive distance-regular graphs
inferred← citeshttps://doi.org/10.5705/ss.202015.0045openalex-snapshot
ON OPTIMALITY AND CONSTRUCTION OF CIRCULAR REPEATED-MEASUREMENTS DESIGNS
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.