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

DOI10.1007/978-3-319-46310-0_8zbMATH Open1364.05049arXiv1511.07537OpenAlexW2964105682MaRDI QIDQ5268907FDOQ5268907

H. Kharaghani, Sho Suda

Publication date: 21 June 2017

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

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.

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)

Cites Work

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

Cited In (5)

• On graphs in which the Hoffman bound for cocliques equals the Cvetcovich bound
• Disjoint weighing matrices
• Balancedly splittable Hadamard matrices
• On association schemes generated by a relation or an idempotent
• 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)