Automorphisms of kaleidoscopical graphs

dc.contributor.author	Protasov, I.V.
dc.contributor.author	Protasova, K.D.
dc.date.accessioned	2019-06-20T03:06:56Z
dc.date.available	2019-06-20T03:06:56Z
dc.date.issued	2007
dc.identifier.citation	Automorphisms of kaleidoscopical graphs / I.V. Protasov, K.D. Protasova // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 125–129. — Бібліогр.: 1 назв. — англ.	uk_UA
dc.identifier.issn	1726-3255
dc.identifier.other	2000 Mathematics Subject Classification: 05C15, 05C25.
dc.identifier.uri	http://dspace.nbuv.gov.ua/handle/123456789/157366
dc.description.abstract	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 codes. We describe the groups of automorphisms of kaleidoscopical trees and Hamming graphs. We show also that every finitely generated group can be realized as the group of automorphisms of some kaleidoscopical graphs.	uk_UA
dc.language.iso	en	uk_UA
dc.publisher	Інститут прикладної математики і механіки НАН України	uk_UA
dc.relation.ispartof	Algebra and Discrete Mathematics
dc.title	Automorphisms of kaleidoscopical graphs	uk_UA
dc.type	Article	uk_UA
dc.status	published earlier	uk_UA