Hoffman’s Coclique Bound for Normal Regular Digraphs, and Nonsymmetric Association Schemes

DOI10.1007/978-3-319-46310-0_8zbMath1364.05049arXiv1511.07537OpenAlexW2964105682MaRDI QIDQ5268907

Sho Suda, Hadi Kharaghani

Publication date: 21 June 2017

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.07537

zbMATH Keywords

association schemeHadamard matrixHoffman's coclique boundregular biangular matrixskew-Bush-typetwin asymmetric design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Balancedly splittable Hadamard matrices, On association schemes generated by a relation or an idempotent, Spectral analysis of non-Hermitian matrices and directed graphs, Disjoint weighing matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of graphs
• Spreads in strongly regular graphs
• Distance regular graphs of diameter 3 and strongly regular graphs
• 3-class association schemes and Hadamard matrices of a certain block form
• Doubly regular digraphs and symmetric designs
• Mutually unbiased bush-type Hadamard matrices and association schemes
• Mutually Unbiased Biangular Vectors and Association Schemes
• Symmetric Bush-type Hadamard matrices of order $4m^4$ exist for all odd $m$
• On a problem of K. A. Bush concerning Hadamard matrices