<p>Interconnection networks are involved in many important computer science fields, such as sensor networks, cluster computing, and embedded systems. In general, constructing scalable, reliable, and effective communication systems in various disciplines depends on interconnection networks. They serve as the backbone that makes it easier for linked components to communicate and share data, allowing complicated systems to function smoothly. In this paper, a hybrid interconnection network based on the diamond graph and hypercube is proposed, which is called diamond hypercube (DQ). The DQ structure is presented in detail, and its topological properties are presented and proved in terms of size, diameter, minimum and maximum node degrees, cost, and bisection width. A comparison between DQ and other well-known interconnection networks has been presented and discussed in terms of the topological properties mentioned. Analytical results show that the DQ structure achieves excellent diameter with reasonable cost, excellent node degree, and excellent bisection width. Also, the DQ structure has other desirable features; for example, it is a planar graph, and it has a Hamiltonian path, which makes it suitable for various applications, such as circuit design, cryptography, bioinformatics, and game theory. Additionally, a one-to-one routing algorithm has been applied on the DQ interconnection network where simulation results show excellent performance in terms of communication latency in comparison with other interconnection networks.</p>