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 +...
Saved in:
Main Author: | Dejter, Italo J.; University of Puerto Rico Rio Piedras, PR 0936-8377 (Author) |
---|---|
Format: | EJournal Article |
Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2021-04-15.
|
Subjects: | |
Online Access: | Get Fulltext |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Rainbow perfect domination in lattice graphs
by: Fuentes, Luis R.; University of Puerto Rico Rio Piedras, PR 0936-8377 Puerto Rico, et al.
Published: (2018) -
On the crossing number of join product of the discrete graph with special graphs of order five
by: Staš, Michal; Technical University of Košice
Published: (2020) -
Some structural graph properties of the non-commuting graph of a class of finite Moufang loops
by: Bashir, Hamideh Hasanzadeh; Department of Mathematics, Science and Research Branch, Islamic Azad University Iran, et al.
Published: (2020) -
On the spectrum of a class of distance-transitive graphs
by: Mirafzal, Seyed Morteza; Department of Mathematics Lorestan University, Khoramabad, Iran, et al.
Published: (2017) -
A note on the generator subgraph of a graph
by: Mame, Neil Mores; College of Arts and Sciences, Batangas State University, Batangas City, Philippines, et al.
Published: (2020)