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

Ful tanımlama

Kaydedildi:
Detaylı Bibliyografya
Asıl Yazarlar: Alaeiyan, Mehdi; School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran (Yazar), Mehrabani, Ayoob; School of Mathematics, Iran University of Science and Technology, Narmak, Tehran 16846, Iran (Yazar)
Materyal Türü: EJournal Article
Baskı/Yayın Bilgisi: GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB, 2017-10-16.
Konular:
info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article
Online Erişim:Get Fulltext
Get Fulltext
Etiketler: Etiketle
Etiket eklenmemiş, İlk siz ekleyin!

Internet

Get Fulltext
Get Fulltext

3rd Floor Main Library

Detaylı Erişim Bilgileri 3rd Floor Main Library
Yer Numarası: A1234.567
Kopya Bilgisi 1 Kütüphanede

Benzer Materyaller