A numeral system for the middle-levels graphs
A sequence S of restricted-growth strings unifies the presentation of middle-levels graphs Mk as follows, for 0 < k ∈ Z. Recall Mk is the subgraph in the Hasse diagram of the Boolean lattice 2[2k+1] induced by the k- and (k+1)-levels. The dihedral group D4k+2 acts on Mk via translations mod (2k +...
Spremljeno u:
| Glavni autor: | |
|---|---|
| Format: | EJournal Article |
| Izdano: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
| Teme: | |
| Online pristup: | Get Fulltext |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
Internet
Get Fulltext3rd Floor Main Library
| Signatura: |
A1234.567 |
|---|---|
| Primjerak 1 | Dostupno |