Automorphisms of kaleidoscopical graphs
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...
Gespeichert in:
| Veröffentlicht in: | Algebra and Discrete Mathematics |
|---|---|
| Datum: | 2007 |
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | Englisch |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2007
|
| Online Zugang: | https://nasplib.isofts.kiev.ua/handle/123456789/157366 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | Automorphisms of kaleidoscopical graphs / I.V. Protasov, K.D. Protasova // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 125–129. — Бібліогр.: 1 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| _version_ | 1862731585227325440 |
|---|---|
| author | Protasov, I.V. Protasova, K.D. |
| author_facet | Protasov, I.V. Protasova, K.D. |
| citation_txt | Automorphisms of kaleidoscopical graphs / I.V. Protasov, K.D. Protasova // Algebra and Discrete Mathematics. — 2007. — Vol. 6, № 2. — С. 125–129. — Бібліогр.: 1 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| 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.
|
| first_indexed | 2025-12-07T19:26:42Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-157366 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-12-07T19:26:42Z |
| publishDate | 2007 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Protasov, I.V. Protasova, K.D. 2019-06-20T03:06:56Z 2019-06-20T03:06:56Z 2007 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. https://nasplib.isofts.kiev.ua/handle/123456789/157366 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. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics Automorphisms of kaleidoscopical graphs Article published earlier |
| spellingShingle | Automorphisms of kaleidoscopical graphs Protasov, I.V. Protasova, K.D. |
| title | Automorphisms of kaleidoscopical graphs |
| title_full | Automorphisms of kaleidoscopical graphs |
| title_fullStr | Automorphisms of kaleidoscopical graphs |
| title_full_unstemmed | Automorphisms of kaleidoscopical graphs |
| title_short | Automorphisms of kaleidoscopical graphs |
| title_sort | automorphisms of kaleidoscopical graphs |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/157366 |
| work_keys_str_mv | AT protasoviv automorphismsofkaleidoscopicalgraphs AT protasovakd automorphismsofkaleidoscopicalgraphs |