scientific article
From MaRDI portal
Publication:3931443
zbMath0475.05073MaRDI QIDQ3931443
No author found.
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of finite geometries (05B25) Graph theory (05C99) Combinatorial structures in finite projective spaces (51E20)
Related Items (33)
Implementing Brouwer's database of strongly regular graphs ⋮ Switching classes of directed graphs and H-equivalent matrices ⋮ Pancyclicity in switching classes ⋮ Regular weights and the Johnson scheme ⋮ Aspects of topological approaches for data science ⋮ Johan Jacob Seidel ⋮ Regular two-graphs on 36 vertices ⋮ Two-graphs and skew two-graphs in finite geometries ⋮ Finite metrics in switching classes ⋮ Tournaments, 4-uniform hypergraphs, and an exact extremal result ⋮ Even signings, signed switching classes, and (-1,1)-matrices ⋮ Subgraph complementation ⋮ On deciding switching equivalence of graphs ⋮ Binary codes and quasi-symmetric designs ⋮ A global code invariant under the Higman-Sims group ⋮ Regular 2-graphs and extensions of partial geometries ⋮ The behavior of clique-width under graph operations and graph transformations ⋮ Is Taylor's graph geometric? ⋮ Equiangular tight frames from complex Seidel matrices containing cube roots of unity ⋮ Distance regular covers of the complete graph ⋮ Type-II matrices in weighted Bose-Mesner algebras of ranks 2 and 3 ⋮ Cohomological Aspects of Hypergraphs ⋮ Graphs with most number of three point induced connected subgraphs ⋮ On Gromov's method of selecting heavily covered points ⋮ Association schemes on triples and a ternary algebra ⋮ Regular weights of full rank on strongly regular graphs ⋮ L-polytopes and equiangular lines ⋮ Partial complementation of graphs ⋮ Tight distance-regular graphs ⋮ Switching classes of directed graphs ⋮ Reconstruction from vertex-switching ⋮ Weighted association schemes, fusions, and minimal coherent closures ⋮ Signatures and signed switching classes
This page was built for publication:
