Perfect 2-colorings of the cubic graphs of order less than or equal to 10

Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect -coloring of a graph with colors is a partition of the vertex set of into m parts,..., such that, for all, every vertex of is adjacent to the same number of vertices, namely, vertices, of. The matrix, is called the parameter matrix. We study the perfect 2-colorings (also known as the equitable partitions into two parts) of the cubic graphs of order less than or equal to 10. In particular, we classify all the realizable parameter matrices of perfect 2-colorings for the cubic graphs of order less than or equal to 10.

Abstract licence: CC BY-NC

11 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.