Perfect 3-colorings of the cubic graphs of order 10
<p>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...
| Hoofdauteurs: | , |
|---|---|
| Formaat: | Artikel |
| Taal: | English |
| Gepubliceerd in: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-10-01
|
| Reeks: | Electronic Journal of Graph Theory and Applications |
| Onderwerpen: | |
| Online toegang: | https://www.ejgta.org/index.php/ejgta/article/view/316 |