Automorphisms of kaleidoscopical graphs

• Published in: Algebra and Discrete Mathematics
• Date: 2007
• ISSN: 1726-3255
• Main Authors: Protasov, I.V., Protasova, K.D.
• Format: Article
• Language: English
• Published: Інститут прикладної математики і механіки НАН України 2007
• Online Access: https://nasplib.isofts.kiev.ua/handle/123456789/157366
• Journal Title: Digital Library of Periodicals of National Academy of Sciences of Ukraine
• Cite this: Automorphisms of kaleidoscopical graphs / I.V. Protasov, K.D. Protasova // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 125–129. — Бібліогр.: 1 назв. — англ.

A regular connected graph Γ of degree s is called
 kaleidoscopical if there is a (s + 1)-coloring of the set of its vertices such that every unit ball in Γ has no distinct monochrome
 points. The kaleidoscopical graphs can be considered as a graph
 counterpart of the Hamming...