Derives necessary conditions for equitable partitions of regular graphs and for (a,b)-perfect sets in normal Cayley graphs using irreducible characters.
Neumaier, Completely regular codes,Discrete Math.106/107 (1992) 353–360
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Equitable partitions of regular graphs, and perfect sets in normal Cayley graphs
Derives necessary conditions for equitable partitions of regular graphs and for (a,b)-perfect sets in normal Cayley graphs using irreducible characters.