An upper bound for the crossing number of augmented cubes

DOI10.1080/00207160.2012.726711zbMath1281.68167arXiv1210.6161OpenAlexW2046560106MaRDI QIDQ2868165

Yuansheng Yang, Guoqing Wang, Wenping Zheng, Haoli Wang, Xuezhi Yang

Publication date: 23 December 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.6161

zbMATH Keywords

hypercubedrawingcrossing numberinterconnection networkaugmented cube

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

The crossing number of locally twisted cubes \(L T Q_n\) ⋮ A survey of graphs with known or bounded crossing numbers

Cites Work

• Unnamed Item
• On crossing numbers of hypercubes and cube connected cycles
• A framework for solving VLSI graph layout problems
• The forwarding indices of augmented cubes
• Geodesic pancyclicity and balanced pancyclicity of augmented cubes
• Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
• Conditional edge-fault Hamiltonicity of augmented cubes
• Cycle embedding of augmented cubes
• Geodesic-pancyclicity and fault-tolerant panconnectivity of augmented cubes
• The crossing numbers of generalized Petersen graphs with small order
• Intersections of curve systems and the crossing number of \(C_ 5\times C_ 5\)
• Fault-tolerant pancyclicity of augmented cubes
• On the crossing numbers of loop networks and generalized Petersen graphs
• Generalized Hypercube and Hyperbus Structures for a Computer Network
• Crossing Number is NP-Complete
• An improved upper bound on the crossing number of the hypercube
• New lower bound techniques for VLSI
• The crossing number of c₄ × c₄
• Augmented cubes
• The crossing number of K₁₁ is 100
• Toward a theory of crossing numbers
• Crossing Number Problems
• Bounds for the crossing number of the N‐cube