scientific article; zbMATH DE number 3884175
From MaRDI portal
Publication:3218138
Recommendations
Cited in
(only showing first 100 items - show all)- On self-complementary strongly regular graphs
- Strongly regular designs and coherent configurations of type \([{32\atop\;3}]\)
- Interesting pointsets in generalized quadrangles and partial geometries
- Characterization theorems for Zara graphs
- Galois correspondence between permutation groups and cellular rings (association schemes)
- Regular 2-graphs and extensions of partial geometries
- Matrix constructions of divisible designs
- Partitions in matrices and graphs
- New bounds and constructions for authentication/secrecy codes with splitting
- Improvement of Bruck's completion theorem
- Symmetric divisible designs with \(k-\lambda{}_ 1=1\)
- Designs constructed from maximal arcs
- Diagram geometries for sharply \(n\)-transitive sets of permutations or of mappings
- The dual of Pasch's axiom
- Second neighbourhoods of strongly regular graphs
- Structure and uniqueness of the \((81,20,1,6)\) strongly regular graph
- Subplane covered nets and semipartial geometries
- Is Taylor's graph geometric?
- Designs as maximum codes in polynomial metric spaces
- Skew-symmetric association schemes with two classes and strongly regular graphs of type \(L_{2n-1}(4n-1)\)
- Nonregular graphs with three eigenvalues
- Three-class association schemes
- A survey of partial difference sets
- Strongly regular fusions of tensor products of strongly regular graphs
- Geometric characterization of the sporadic groups \(Fi_{22}\), \(Fi_{23}\), and \(Fi_{24}\)
- Proof of a conjecture of de Caen and van Dam
- Partitions of sets of designs on seven, eight and nine points
- Strongly regular graphs that are locally a disjoint union of hexagons
- Simple connectedness of the 3-local geometry of the Monster
- Overlarge sets and partial geometries
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- Directed strongly regular graphs obtained from coherent algebras
- Permutation decoding for the binary codes from triangular graphs.
- Partial geometries, their extensions, and related graphs
- A spectral characterization of the \(s\)-clique extension of the square grid graphs
- On the locating matrix of a graph and its spectral analysis
- On Deza graphs with disconnected second neighborhood of a vertex
- Equiangular tight frames with centroidal symmetry
- Combinatorial designs with two singular values. II: Partial geometric designs
- There is no (75,32,10,16) strongly regular graph
- A nonregular analogue of conference graphs
- Strongly edge triangle regular graphs and a conjecture of Kotzig
- Regular weights of full rank on strongly regular graphs
- A (49,16,3,6) strongly regular graph does not exist
- Binary codes from graphs on triples
- Optimality of partial geometric designs
- Strongly regular decompositions of the complete graph
- A construction of amorphous association scheme from a pseudo-cyclic association scheme
- Some new cyclotomic strongly regular graphs
- Uniqueness of strongly regular graphs having minimal p-rank
- Regular graphs with four eigenvalues
- Chromatic invariants for finite graphs: Theme and polynomial variations
- Partitions of sets of two-fold triple systems, and their relations to some strongly regular graphs
- Regular automorphism groups on partial geometries
- Two characterizations of the grid graphs
- On the non-existence of \(\mathrm{srg}(76,21,2,7)\)
- Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry
- Nonisotropic symplectic graphs over finite commutative rings
- Strongly regular configurations
- On some distance-regular graphs with many vertices
- A construction for clique-free pseudorandom graphs
- New strongly regular graphs from finite geometries via switching
- On the integrability of strongly regular graphs
- Uniform mixing and association schemes
- Subconstituents of orthogonal graphs of odd characteristic
- Orthogonal graphs over Galois rings of odd characteristic
- On strongly regular graphs with \(\mu \leq 2\)
- Association schemes from the action of \(\text{PGL}(2,q)\) fixing a nonsingular conic in \(\text{PG}(2,q)\)
- Disconnecting strongly regular graphs
- Quadratic embedding constants of graph joins
- On inertia and ratio type bounds for the k-independence number of a graph and their relationship
- Euclidean Jordan Algebras and Strongly Regular Graphs
- Strongly regular graphs arising from Hermitian varieties
- scientific article; zbMATH DE number 3898905 (Why is no real title available?)
- The extendability of matchings in strongly regular graphs
- Finding planted subgraphs with few eigenvalues using the Schur-Horn relaxation
- There is no strongly regular graph with parameters (460, 153, 32, 60)
- On a family of strongly regular graphs with = 1
- scientific article; zbMATH DE number 2149410 (Why is no real title available?)
- Strongly regular graphs
- Partial balanced incomplete block designs arising from a maximum independent set of an SRNT graph
- Orthogonal graphs modulo power of 2
- Graph theoretic parameters associated with PBIB design via partial geometries of generalized polygon
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- scientific article; zbMATH DE number 2235055 (Why is no real title available?)
- Generalized orthogonal graphs of characteristic a power of 2
- Switching for small strongly regular graphs
- Fissioned triangular schemes via the cross-ratio
- Strongly regular \((\alpha,\beta)\)-geometries
- A four-class association scheme
- Codes from lattice and related graphs, and permutation decoding
- proper partial geometries with an automorphism group acting primitively on points and lines
- Graphs with two main and two plain eigenvalues
- Partial geometric designs having circulant concurrence matrices
- Comparison of two techniques for proving nonexistence of strongly regular graphs
- Regular star complements in strongly regular graphs
- Switching equivalence of strongly regular polar graphs
- Positive discrepancy, MaxCut, and eigenvalues of graphs
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3218138)
