perfect 3-colorings of cubic graphs of order $8$

Clicks: 65
ID: 230159
2018
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #26 of 31 articles by views in Anticancer research

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
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$.
Reference Key
alaeiyan2018armenianperfect Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Mehdi Alaeiyan;Ayoob Mehrabani
Journal Anticancer research
Year 2018
DOI
DOI not found
URL
http://armjmath.sci.am/index.php/ajm/article/view/152
Keywords Keywords not found

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.