We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
Perfect coloring is a generalization of the notion of completely regular codes, given by Delsarte. A perfect m-coloring of a graph G with m colors is a partition of the vertex set of G into m parts A1β, β¦, Amβ such that, for all i,jβ{1,β―,m}, every vertex of Aiβ is adjacent to the same number of vertices, namely, aijβ vertices, of Ajβ . The matrix A=(aijβ)i,jβ{1,β―,m}β is called the parameter matrix. We study the perfect 3-colorings (also known as the equitable partitions into three parts) of the cubic graphs of order 8. In particular, we classify all the realizable parameter matrices of perfect 3-colorings for the cubic graphs of order 8
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.