On the public citation graph
Tables of two-graphs
0 signed · 60 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/bf01215145openalex-snapshot
Cohomological aspects of two-graphs
inferredcites →https://doi.org/10.1007/bfb0089374openalex-snapshot
On Construction and Identification of Graphs
inferredcites →https://doi.org/10.1016/0095-8956(77)90079-xopenalex-snapshot
Automorphisms and cohomology of switching classes
inferredcites →https://doi.org/10.1016/b978-0-12-189420-7.50018-9openalex-snapshot
A SURVEY OF TWO-GRAPHS
inferredcites →https://doi.org/10.1016/b978-0-12-189420-7.50022-0openalex-snapshot
TWO-GRAPHS, A SECOND SURVEY
inferredcites →https://doi.org/10.1016/s0167-5060(08)70319-4openalex-snapshot
Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations
inferredcites →https://doi.org/10.1016/s1385-7258(66)50038-5openalex-snapshot
Equilateral point sets in elliptic geometry
inferredcites →https://doi.org/10.1111/j.1749-6632.1970.tb56454.xopenalex-snapshot
SYMMETRIC HADAMARD MATRICES OF ORDER 36
inferredcites →https://doi.org/10.1137/0128070openalex-snapshot
Two-Graphs, Switching Classes and Euler Graphs are Equal in Number
inferredcites →https://doi.org/10.4153/cjm-1967-091-8openalex-snapshot
Orthogonal Matrices with Zero Diagonal
inferredcites →https://doi.org/10.4153/cjm-1978-029-1openalex-snapshot
Symmetric Conference Matrices of Order pq 2 + 1
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-3-319-17729-8_19openalex-snapshot
The Hunt for Weighing Matrices of Small Orders
inferred← citeshttps://doi.org/10.1007/978-94-017-1972-8_1openalex-snapshot
Cellular Rings and Groups of Automorphisms of Graphs
inferred← citeshttps://doi.org/10.1007/bf02774023openalex-snapshot
Regular weights and the Johnson scheme
inferred← citeshttps://doi.org/10.1007/s004540010038openalex-snapshot
Ubiquitous Angles in Equiangular Sets of Lines
inferred← citeshttps://doi.org/10.1007/s10623-021-00858-8openalex-snapshot
Spectral symmetry in conference matrices
inferred← citeshttps://doi.org/10.1007/s10801-009-0209-9openalex-snapshot
Type-II matrices in weighted Bose–Mesner algebras of ranks 2 and 3
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90055-6openalex-snapshot
On self-complementary strongly regular graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90357-9openalex-snapshot
The Steiner systems S(2,4,25) with nontrivial automorphism group
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00158-nopenalex-snapshot
Regular two-graphs on 36 vertices
inferred← citeshttps://doi.org/10.1016/0024-3795(95)00184-sopenalex-snapshot
Uniqueness of strongly regular graphs having minimal p-rank
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90042-1openalex-snapshot
A symmetric BIBD with trivial automorphism group
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/0097-3165(90)90068-8openalex-snapshot
Association schemes on triples and a ternary algebra
inferred← citeshttps://doi.org/10.1016/b978-044488355-1/50017-7openalex-snapshot
Discrete Non-Euclidean Geometry
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.10.009openalex-snapshot
Enumeration of Seidel matrices
inferred← citeshttps://doi.org/10.1016/j.jcta.2012.03.013openalex-snapshot
On triple systems and strongly regular graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2015.09.008openalex-snapshot
Equiangular lines in Euclidean spaces
inferred← citeshttps://doi.org/10.1016/j.jfa.2019.05.011openalex-snapshot
Computation of maximal projection constants
inferred← citeshttps://doi.org/10.1016/j.laa.2005.02.016openalex-snapshot
Frames, graphs and erasures
inferred← citeshttps://doi.org/10.1016/j.laa.2007.05.043openalex-snapshot
On the existence of equiangular tight frames
inferred← citeshttps://doi.org/10.1016/j.laa.2018.03.037openalex-snapshot
On switching classes of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00150-7openalex-snapshot
Graphs with constant μ and μ
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70103-1openalex-snapshot
The Steiner Systems S(2,4,25) with Nontrivial Automorphism Group
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70652-6openalex-snapshot
On Spectra of Trees and Related Two-Graphs
inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80021-4openalex-snapshot
Conference Matrices from Projective Planes of Order 9
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72897-4openalex-snapshot
On the Steiner Systems S(2,4,25) invariant under a group of order 9
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72986-4openalex-snapshot
Tables of Parameters of BIBDs with r⩽41 including Existence, Enumeration, and Resolvability Results
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73507-2openalex-snapshot
Regular and Strongly Regular Selfcomplementary Graphs
inferred← citeshttps://doi.org/10.1023/a:1008379409579openalex-snapshot
The Search for Pseudo Orthogonal Latin Squares of Order Six
inferred← citeshttps://doi.org/10.1023/a:1018628204156openalex-snapshot
Three-Class Association Schemes
inferred← citeshttps://doi.org/10.1023/a:1026479210284openalex-snapshot
Binary Codes of Strongly Regular Graphs
inferred← citeshttps://doi.org/10.1080/03081089508818382openalex-snapshot
Graphs cospectral with distance-regular graphs
inferred← citeshttps://doi.org/10.1090/s0025-5718-1992-1134718-6openalex-snapshot
Exceptional Graphs with Smallest Eigenvalue -2 and Related Problems
inferred← citeshttps://doi.org/10.1093/biomet/82.3.589openalex-snapshot
Screening by Conference Designs
inferred← citeshttps://doi.org/10.1117/12.615773openalex-snapshot
Loss-insensitive vector encoding with two-uniform frames
inferred← citeshttps://doi.org/10.1137/19m1307895openalex-snapshot
Globally Optimizing Small Codes in Real Projective Spaces
inferred← citeshttps://doi.org/10.1137/s0895480100381890openalex-snapshot
A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1142/s0219498816501759openalex-snapshot
Groups all of whose undirected Cayley graphs are determined by their spectra
inferred← citeshttps://doi.org/10.1216/rmj-2011-41-1-133openalex-snapshot
Numerical measures for two-graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2161.f55openalex-snapshot
On sign-symmetric signed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02943openalex-snapshot
Enumeration of Seidel matrices
inferred← citeshttps://doi.org/10.48550/arxiv.1809.05739openalex-snapshot
Equiangular lines, Incoherent sets and Quasi-symmetric designs
inferred← citeshttps://doi.org/10.5802/alco.470openalex-snapshot
Switching equivalence of strongly regular polar graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1374openalex-snapshot
Towards a characterization of bipartite switching classes by means of forbidden subgraphs
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.