Automorphisms of kaleidoscopical graphs
Vernadsky National Library of Ukraine
Переглянути архів Інформація| Поле | Співвідношення | |
| Title |
Automorphisms of kaleidoscopical graphs
|
|
| Creator |
Protasov, I.V.
Protasova, K.D. |
|
| Description |
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. |
|
| Date |
2019-06-20T03:06:56Z
2019-06-20T03:06:56Z 2007 |
|
| Type |
Article
|
|
| Identifier |
Automorphisms of kaleidoscopical graphs / I.V. Protasov, K.D. Protasova // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 125–129. — Бібліогр.: 1 назв. — англ.
1726-3255 2000 Mathematics Subject Classification: 05C15, 05C25. http://dspace.nbuv.gov.ua/handle/123456789/157366 |
|
| Language |
en
|
|
| Relation |
Algebra and Discrete Mathematics
|
|
| Publisher |
Інститут прикладної математики і механіки НАН України
|
|