  We constructs a new network by superposition of hexahedron , which are
scale-free, highly sparse,disassortative ,and maximal planar graphs. The
network degree distribution, agglomeration coefficient and degree of
correlation are computed separately using the iterative method, and these
characteristics are found to be very rich. The method of network characteristic
analysis can be applied to some actual systems, so as to study the complexity
of real network system under the framework of complex network theory.
