Perfect 3-colorings of the cubic graphs of order 10
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 A_1, A_2, ..., A_m such that, for all $ i,j \in \lbrace 1, ... , m \rbrace $, every vertex of A_i is a...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | EJournal Article |
| 出版: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
| 主题: | |
| 在线阅读: | Get Fulltext Get Fulltext |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
因特网
Get FulltextGet Fulltext
3rd Floor Main Library
| 索引号: |
A1234.567 |
|---|---|
| 复印件 1 | 可用 |