Article ID Journal Published Year Pages File Type
9513458 Discrete Mathematics 2005 18 Pages PDF
Abstract
In this context, strongly regular graphs may be generalized to arbitrary association schemes. When the association scheme is a collection of circular blocks then a colouring is balanced if the design in blocks is a 2-design and there is undirectional neighbour balance at all distances around the circle.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Balanced colourings of strongly regular graphs
Authors
,