Orientations of the n-cube with minimum diameter

DOI10.1016/0012-365X(88)90123-9zbMath0704.05030MaRDI QIDQ916678

Joseph E. McCanna

Publication date: 1988

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

zbMATH Keywords

diameterorientation

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (10)

Methods and problems of communication in usual networks ⋮ Oriented hypercubes ⋮ Optimal orientations of products of paths and cycles ⋮ Bounds for the oriented diameter of planar triangulations ⋮ A possible optimal design of one-way Hamming network \(H(n,3)\) based on the minimum transmission latency ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Oriented diameter of graphs with diameter 3 ⋮ The orientation number of two complete graphs with linkages ⋮ On a conjecture concerning the orientation number of a graph ⋮ On optimal orientations of Cartesian products of graphs. I

Cites Work

• Unnamed Item
• Unnamed Item
• On 1-rotational \(S_\lambda(2,3,v)\) designs
• Two-fold triple systems without repeated blocks
• Cyclic neofields and combinatorial designs
• On the existence of 2-designs S\(_2\)(2,3,v) without repeated blocks

This page was built for publication: Orientations of the n-cube with minimum diameter