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...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | EJournal Article |
| Publicado: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
| Materias: | |
| Acceso en línea: | Get Fulltext Get Fulltext |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Internet
Get FulltextGet Fulltext
3rd Floor Main Library
| Número de Clasificación: |
A1234.567 |
|---|---|
| Copia 1 | Disponible |