An upper bound for the crossing number of augmented cubes

A good drawing of a graph G is a drawing where the edges are non-self-intersecting and each of the two edges have at most one point in common, which is either a common end vertex or a crossing. The crossing number of a graph G is the minimum number of pairwise intersections of edges in a good drawing of G in the plane. The n -dimensional augmented cube AQ n , proposed by S.A. Choudum and V. Sunitha [ Augmented cubes , Networks 40 2002, pp. 71–84], is an important interconnection network with good topological properties and applications. In this paper, we obtain an upper bound on the crossing number of AQ n less than .