Perfect 3-colorings of the cubic graphs of order 10

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...

Cijeli opis

Spremljeno u:
Bibliografski detalji
Glavni autori: Alaeiyan, Mehdi; School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran (Autor), Mehrabani, Ayoob; School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran (Autor)
Format: EJournal Article
Izdano: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2017-10-16.
Teme:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online pristup:Get Fulltext
Get Fulltext
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!

Internet

Get Fulltext
Get Fulltext

3rd Floor Main Library

Detalji primjeraka od 3rd Floor Main Library
Signatura: A1234.567
Primjerak 1 Dostupno

Similar Items