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: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
| Subjects: | |
| Online Access: | Get Fulltext Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get FulltextGet Fulltext
3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |