This article discusses a mixed graph called mixed hourglass graph. The adjacency of a mixed hourglass graph is coined from an hourglass matrix in which the matrix is obtained from quadratic interlocking factorization. Mixed hourglass graph is a weighted graph with loops, but replacing the weights of the graph with 1’s produce an unweighted mixed hourglass graph or simply mixed hourglass graph. Then the total number of arcs and edges and the spanning subgraph of mixed hourglass graph are examined to infer that the graph is a complete mixed graph and acyclic graph.