Divisible design graphs

WH Haemers, H Kharaghani, Maria Meulenberg

Research output: Contribution to journalArticleAcademicpeer-review

31 Citations (Scopus)


A divisible design graph is a graph whose adjacency matrix is the incidence matrix of a divisible design. Divisible design graphs are a natural generalization of (v,k,lambda)-graphs, and like (v,k,lambda)-graphs they make a link between combinatorial design theory and algebraic graph theory. The study of divisible design graphs benefits from, and contributes to, both parts. Using information of the eigenvalues of the adjacency matrix, we obtain necessary conditions for existence. Old results of Bose and Connor on symmetric divisible designs give other conditions and information on the structure. Many constructions are given using various combinatorial structures, such as (v,k,lambda)-graphs, distance-regular graphs, symmetric divisible designs. Hadamard matrices, and symmetric balanced generalized weighing matrices. Several divisible design graphs are characterized in terms of the parameters. (C) 2010 Elsevier Inc. All rights reserved.
Original languageUndefined/Unknown
Pages (from-to)978-992
Number of pages15
JournalJournal of Combinatorial Theory Series A
Issue number3
Publication statusPublished - 2011

Research programs

  • EMC NIHES-02-65-01

Cite this