English

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

Combinatorics 2015-11-25 v1

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.

Keywords

Cite

@article{arxiv.1511.07537,
  title  = {Hoffman's coclique bound for normal regular digraphs, and nonsymmetric association schemes},
  author = {Hadi Kharaghani and Sho Suda},
  journal= {arXiv preprint arXiv:1511.07537},
  year   = {2015}
}

Comments

14 pages

R2 v1 2026-06-22T11:52:47.436Z