Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes

DOI10.1007/978-3-319-46310-0_8MaRDI QIDQ5268907zbMATH OpenOpenAlexFDO

Authors Sho Suda, H. 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

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

Abstract: We extend Hoffman's coclique bound for regular digraphs with the property that its adjacency matrix is normal, and discuss cocliques attaining the inequality. As a consequence, we characterize skew-Bush-type Hadamard matrices in terms of digraphs. We present some normal digraphs whose vertex set is decomposed into disjoint cocliques attaining the bound. The digraphs provided here are relation graphs of some nonsymmetric association schemes.

Recommendations

• On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound
• Normally regular digraphs
• Normally regular digraphs, association schemes and related combinatorial structures
• On the multiplicities of digraph eigenvalues
• On nonsymmetric P- and Q-polynomial association schemes

Cites work

• scientific article; zbMATH DE number 3935054 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• 3-class association schemes and Hadamard matrices of a certain block form
• Distance regular graphs of diameter 3 and strongly regular graphs
• Doubly regular digraphs and symmetric designs
• Mutually Unbiased Biangular Vectors and Association Schemes
• Mutually unbiased bush-type Hadamard matrices and association schemes
• On a problem of K. A. Bush concerning Hadamard matrices
• Spectra of graphs
• Spreads in strongly regular graphs
• Symmetric Bush-type Hadamard matrices of order 4m^4 exist for all odd m

Cited in

(7)

• On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound
• Disjoint weighing matrices
• Balancedly splittable Hadamard matrices
• Constructions of self-orthogonal and LCD subspace codes
• On association schemes generated by a relation or an idempotent
• Normally regular digraphs, association schemes and related combinatorial structures
• Spectral analysis of non-Hermitian matrices and directed graphs

This page was built for publication: Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268907)