@article{Article_18,

title = {Perfect 3-Colorings of Some Generalized Peterson Graph},

journal = {Communications in Combinatorics, Cryptography & Computer Science},

volume = {2021},

issue = {2},

issn = { 2783-5456 },

year = {2021},

url = {http://cccs.sgh.ac.ir/Articles/2021/issue 2/2-6-perfect_3colorings_of_some_generalized_peterson_graph-1638187450.pdf},

author = {Mehdi Alaeiyan and Zahra Shokoohi},

keywords = {Parameter matrices, Perfect coloring, Equitable partition, Generalized peterson graph.},

abstract = {The notion of a perfect coloring, introduced by Delsarte, generalizes the concept of completely regular code. A perfect z-colorings of a graph is a partition of its vertex set. It splits vertices into z parts P1, , Pz such that for all i, j 2 f1, , zg, each vertex of Pi is adjacent to pij, vertices of Pj. The matrix P = (pij)i,j2f1, ,zg, is called parameter matrix. In this article, we classify all the realizable parameter matrices of perfect 3-colorings of some the generalized peterson graph.}

};