Strongly regular graphs with strongly regular decomposition

DOI10.1016/0024-3795(89)90471-0zbMath0719.05069OpenAlexW1998681311MaRDI QIDQ2639877

Willem H. Haemers, D. G. Higman

Publication date: 1989

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(89)90471-0

zbMATH Keywords

Partitionsstrongly regular graphsquasi- symmetric designsstrongly regular subgraphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (19)

More on graphs with just three distinct eigenvalues ⋮ Regular graphs with four eigenvalues ⋮ Star partitions and regularity in graphs ⋮ Relative hemisystems on the Hermitian surface ⋮ Star partitions and the graph isomorphism problem ⋮ Strong star complements in graphs ⋮ A new construction of strongly regular graphs with parameters of the complement symplectic graph ⋮ On strongly regular designs admitting fusion to strongly regular decomposition ⋮ Intriguing sets of quadrics in \(\mathrm{PG}(5, q)\) ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Star complementary strongly regular decompositions of strongly regular graphs ⋮ Signed graphs with totally disconnected star complements ⋮ Spreads in strongly regular graphs ⋮ A problem concerning graphs with just three distinct eigenvalues ⋮ Combinatorial designs with two singular values. II: Partial geometric designs ⋮ Graphs whose normalized Laplacian has three eigenvalues ⋮ On graphs with three eigenvalues ⋮ A new family of relative hemisystems on the Hermitian surface ⋮ A decomposition of signed graphs with two eigenvalues

Cites Work

• A survey of some problems in combinatorial designs - a matrix approach
• Quasi-symmetric designs and self-dual codes
• Quasi-symmetric \(2\text{-}(31,7,7)\) designs and a revision of Hamada's conjecture
• The application of invariant theory to the existence of quasi-symmetric designs
• Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)]
• Geometric invariants for quasi-symmetric designs
• The regular two-graph on 276 vertices
• A characterization of partial geometric designs
• Special partially balanced incomplete block designs and associated graphs
• An Erdős-Ko-Rado theorem for regular intersecting families of octads
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strongly regular graphs with strongly regular decomposition