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 +...
में बचाया:
| मुख्य लेखक: | |
|---|---|
| स्वरूप: | EJournal Article |
| प्रकाशित: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
| विषय: | |
| ऑनलाइन पहुंच: | Get Fulltext |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
इंटरनेट
Get Fulltext3rd Floor Main Library
| बोधानक: |
A1234.567 |
|---|---|
| प्रति 1 | उपलब्ध |