Perfect 3-colorings of cubic graph of order 8
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 are in {1,..., m}, every vertex of Ai is adjacent to the same...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Republic of Armenia National Academy of Sciences
2018-05-01
|
| Series: | Armenian Journal of Mathematics |
| Online Access: | http://test.armjmath.sci.am/index.php/ajm/article/view/152 |