zbMATH — the first resource for mathematics

Perfect 2-coloring of the quartic graphs with order at most 8. (English) Zbl 07199033
Summary: In this paper, we study perfect 2-coloring of the quartic graphs with at most 8 vertices. The problem of the existence of perfect coloring is a generalization of the concept of completely regular codes, given by Delsarte.
05C15 Coloring of graphs and hypergraphs
05C78 Graph labelling (graceful graphs, bandwidth, etc.)
Full Text: DOI
[1] Ahlswede, R., Aydinian, H.K., Khachatrian, L.H.: On perfect codes and related concepts. Des. Codes Cryptogeraphy 22, 227-237 (2001) · Zbl 0971.94014
[2] Alaeiyan, M., Karami, H.: Perfect 2-coloring of the generalized Petersen graph. Proc. Indian Acad. Sci. N.A 126, 289-294 (2016) · Zbl 1346.05055
[3] Avgustinovich, S.V., Mogilnykh, IYu.: Perfect coloring of the Johnson graph \[J(8,3)\] J(8,3) and \[J(8,4)\] J(8,4) with two colors. J. Appl. Ind. Math. 5, 19-30 (2011)
[4] Avgustinovich, S.V., Mogilnykh, I.Yu.: Perfect 2-coloring of Johnson Graph \[J(6,3)\] J(6,3) and \[J(7,3)\] J(7,3). n Lecture Notes in Computer Science, vol. 5228, pp. 11-19. Springer (2008) · Zbl 1167.05025
[5] Fon-der-Flaass, D.G.: Perfect 2-colorings of a Hypercube. Sib. Math. Zh. 48(4), 923-930 (2007) · Zbl 1164.05348
[6] Gavilyuk, A.L., Goryainov, S.V.: On perfect 2-coloring of Johnson graphs \[J(v,3)\] J(v,3). J. Combin. Des. 21, 232-252 (2013) · Zbl 1266.05033
[7] Godsil, C.: Compact graphs and equitable partitions. Linear Slgebra Aappl. 255, 259-266 (1997) · Zbl 0872.05033
[8] Mogilnykh, IYu.: On the regularity of perfect 2-coloring of the Johnson graph. Problemy Peredachi Inform. 43(4), 37-44 (2007)
[9] Ronald, C.R.: An Atlas of Graphs. University of Waterloo, Waterloo (1998) · Zbl 0908.05001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.