A block negacyclic Bush-type Hadamard matrix and two strongly regular graphs

Authors:
Zvonimir Janko;Hadi Kharaghani
Affiliations:
Mathematical Institute, University of Heidelberg, Heidelberg, Germany;Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Alberta, Canada
Venue:
Journal of Combinatorial Theory Series A
Year:
2002

Citing 2
Cited 2

Design theory

Design theory
Perfect Codes and Balanced Generalized Weighing Matrices

Finite Fields and Their Applications

On a Class of Symmetric Balanced Generalized Weighing Matrices

Designs, Codes and Cryptography
Divisible design graphs

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

A block negacyclic Bush-type Hadamard matrix of order 36 is used in a symmetric BGW (26, 25, 24) with zero diagonal over a cyclic group of order 12 to construct a twin strongly regular graph with parameters υ = 936, k = 375, λ = µ = 150 whose points can be partitioned in 26 cocliques of size 36. The same Hadamard matrix then is used in a symmetric BGW (50, 49, 48) with zero diagonal over a cyclic group of order 12 to construct a Siamese twin strongly regular graph with parameters υ = 1800, k = 1029, λ = µ = 588.