Hypercubes, shuffle-exchange graphs and de Bruijn digraphs

  • Authors:

  • Niall Graham;Frank Harary

  • Affiliations:

  • Computing Research Laboratory New Mexico State University, Las Cruces, NM 88003, U.S.A.;Computing Research Laboratory New Mexico State University, Las Cruces, NM 88003, U.S.A.

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1993

Quantified Score

Hi-index 0.98

Visualization

Abstract

The hypercube Q"n, the shuffle-exchange graph S"n and the teleprinter diagram T"n have the same set of 2^"^n nodes, namely the n digit binary strings. Our purpose is to specify precisely the pairwise intersections of their edge sets and of their arc sets.