Hypercubes, shuffle-exchange graphs and de Bruijn digraphs

DOI10.1016/0895-7177(93)90255-WMaRDI QIDQ1310233zbMATH OpenFDO

Authors Niall Graham, Frank Harary

Publication date 23 June 1994

Published in Mathematical and Computer Modelling (Search for Journal in Brave)

zbMATH Keywords

hypercubede Bruijn digraphsshuffle-exchange graphteleprinter diagramMöbius inversion

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Recommendations

• The shuffle-cubes and their generalization
• Intersection graphs of maximal hypercubes
• scientific article; zbMATH DE number 790411
• On Hamiltonian circuits and spanning trees of hypercubes
• The Hamiltonian property of generalized de Bruijn digraphs

Cites work

• scientific article; zbMATH DE number 3943824 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3422259 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• A survey of the theory of hypercube graphs
• Parallel concepts in graph theory

Cited in

(3)

• Strong bounds and exact solutions to the minimum broadcast time problem
• Permutation-exchange graphs that emulate the binary cube
• An algebraic analysis of the connectivity of De Bruijn and shuffle- exchange digraphs

This page was built for publication: Hypercubes, shuffle-exchange graphs and de Bruijn digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310233)