On edge numberings of the n-cube graph

DOI10.1016/0166-218X(93)90023-HMaRDI QIDQ689968zbMATH OpenFDO

Authors Norbert Grünwald, Karl Weber, Sergej L. Bezrukov

Publication date 16 January 1994

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

sequences\(n\)-cubeedge numberings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30)

Recommendations

• scientific article; zbMATH DE number 4105015
• Partitioning the n-cube into sets with mutual distance 1
• scientific article; zbMATH DE number 812079
• Existence of a maximum balanced matching in the hypercube
• Anti-Turán numbers for cube graphs

Cites work

• scientific article; zbMATH DE number 4105015 (Why is no real title available?)
• scientific article; zbMATH DE number 3345373 (Why is no real title available?)
• A note on the edges of the n-cube
• Minimum range sequences of all k-subsets of a set
• Optimal Assignments of Numbers to Vertices
• Optimal numberings and isoperimetric problems on graphs
• The optimal number of faces in cubical complexes

Cited in

(4)

• Maximum number of edges joining vertices on a cube
• On the edge-bandwidth of graph products
• New results on edge-bandwidth
• scientific article; zbMATH DE number 4105015 (Why is no real title available?)

This page was built for publication: On edge numberings of the \(n\)-cube graph

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