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...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | EJournal Article |
| Vydáno: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2017-10-16.
|
| Témata: | |
| On-line přístup: | Get Fulltext Get Fulltext |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
Internet
Get FulltextGet Fulltext
3rd Floor Main Library
| Signatura: |
A1234.567 |
|---|---|
| Jednotka 1 | Dostupné |