Object

Title: Perfect 3-colorings of Cubic Graphs of Order 8

Publication Details:

Established in 2008

Journal or Publication Title:

Armenian Journal of Mathematics=Հայկական մաթեմատիկական հանդես

Date of publication:

2018

Volume:

10

Number:

2

ISSN:

1829-1163

Official URL:


Contributor(s):

Գլխ. խմբ.՝ Անրի Ներսեսյան ; Պատ. խմբ.՝ Լինդա Խաչատրյան ; Խմբ. տեղակալ՝ Ռաֆայել Բարխուդարյան

Coverage:

1-11

Abstract:

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$, $\dots$, $A_m$ such that, for all $ i,j\in \lbrace 1,\cdots ,m\rbrace $, every vertex of $A_i$ is adjacent to the same number of vertices, namely, $a_{ij}$ vertices, of $A_j$ . The matrix $A=(a_{ij})_{i,j\in \lbrace 1,\cdots ,m\rbrace }$ is called the parameter matrix. We study the perfect 3-colorings (also known as the equitable partitions into three parts) of the cubic graphs of order $8$. In particular, we classify all the realizable parameter matrices of perfect 3-colorings for the cubic graphs of order $8$.

Publisher:

National Academy of Sciences of Armenia

Date created:

2018-06-01

Format:

pdf

Identifier:

oai:arar.sci.am:13313

General note:

Electronic Open Access Publication of the National Academy of Sciences of Armenia

Digitization:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Location of original object:

ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան

Object collections:

Last modified:

Dec 13, 2023

In our library since:

Feb 12, 2020

Number of object content hits:

21

All available object's versions:

https://arar.sci.am/publication/15054

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

Edition name Date
Perfect 3-colorings of Cubic Graphs of Order 8 Dec 13, 2023

Objects

Similar

This page uses 'cookies'. More information