［1］YEHUDA R B,HANOCH E B.A linear-time algorithm for covering simple polygons with similar rectangles［J］.International Journal of Computational Geometry Applications,1996,6(1):79-102.

［2］CULBERSON J C,RECKHOW R A.Covering polygons is hard［J］.Journal of Algorithms,1994,17(2):40-44.

［3］CHOUDUM S A,SUNITHA V.Augmented cubes［J］.Networks,2002,40(2):71-84.

［4］DUNDAR P.Augmented cubes and its connectivety numbers［J］.Neural Network World,2005,15(1):1-8.

［5］HSU H C,CHIANG L C,TAN J J M,et al.Fault hamiltonicity of augmenged cubes［J］.Parallel Computers,2005,31(9):130-145.

［6］FERRARI L,SANKAR P V,SKLANSKY J.Minimal rectangular partitions of digitized blobs［J］.Computer Vision,Graphics and Image Processing,1984,28(5):58-71.

［7］AHMED M T,LAVERS J D,BURKE P E.An evaluation of the direct boundary integral method and the method of fundamental solutions［J］.IEEE Transaction on Magnetics,1989,25(1):3001-3006.

［8］MA M,LIU G,XU J M.The super connectivity of augmented cubes［J］.Information Processing Letters,2008,106(2):59-63.

［9］AHMED M T,LAVERS J D,BURKE P E.A boundary element method to predict to shape of a molten metal free surface in e.m.confinement field［J］.IEEE Transaction on Magnetics,1988,24(3):2521-2523.

［10］BOESCH F T.Synthesis of reliable networks-a survey［J］.IEEE Transaction on Reliability,1986,35(6):240-246.

［11］CHANG Naiwen,SHI Sunyuan.Conditional diagnosability of augmented cubes under the PMC
 model［J］.IEEE Transaction on Computers,2012,9(1):48-49.

［12］JANSEN K,ZHANG G.Maximizing the number of packed rectangles［J］.Lecture Notes in Computer Science,2004,31(11):362-371.

［13］MAYERGOYZ I D.Boundary integral equations of minimumorder for the calculation of 3-D eddy current problems［J］.IEEE Transaction on Magnetics,1982,18(4):536-39.

［14］SHI S Y,SHUI J Y.Cycle embedding of augmented cubes［J］.Applied Math.and Computation,2007,191(2):314-319.

［15］XU M,XU J M.The forwarding indices of augmented cubes［J］.Information Processing Letters,2007,101(5):158-159.