Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal Electronic Journal of Graph Theory and Applications (EJGTA)
Italo J. Dejter
University of Puerto Rico Rio Piedras, PR 00936-8377
Electrical & Electronics Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
A numeral system for the middle-levels graphs Italo J. Dejter
Electronic Journal of Graph Theory and Applications (EJGTA) Vol 9, No 1 (2021): Electronic Journal of Graph Theory and Applications
Publisher : GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.5614/ejgta.2021.9.1.13

Abstract

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 + 1) and complemented reversals.The first (2k)!/(k!(k+1)!) terms of S stand for the orbits of V(Mk) under such D4k+2-action, via the lexical matching colors 0, 1, ... , k on the k+1 edges at each vertex. So, S is proposed here as a convenient numeral system for the graphs Mk. Color 0 allows to reorder S via an integer sequence that behaves as an idempotent permutation on its first (2k)!/(k!(k+1)!) terms, for each 0 < k ∈ Z. Related properties hold for the remaining colors 1, ... , k.
Co-Authors