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

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

［3］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 Transactions on Magnetics,1988,24(6):2521-2523.

［4］AKERS S B,KRISHNAMURTHY B.A group theoretic model for symmetric interconnection networks［J］.IEEE Transactions on Computers,1989,38(4):555-565.

［5］KANEKO,KEIICHI,YASUTO SUZUKI.Node-to-Node Internally Disjoint Paths Problem in Bubble-Sort Graphs［C］.Tahiti,French Polynesia:Proceedings of the Tenth Pacific Rim International Symposium on Dependable Computing,2004:173-182.

［6］YASUTO S,KEIICHI K.An algorithm for disjoint paths in bubble-sort graphs［J］.Systems and Computers in Japan,2006,37(12):27-32.

［7］YOSUKE K,TORU A.Edge-bipancyclicity and edge-fault-tolerant bipancyclicity of bubble-sort graphs［J］.Information Processing Letters,2006,100(2):52-59.

［8］TORU A,YOSUKE K.Hamiltonian laceability of bubble-sort graphs with edge faults［J］.Information Sciences,2007,177(13):2679-2691.

［9］YANG Yuxing,WANG Shiying.Conditional vertex connectivity measures for bubble-sort networks［J］.Computer Engineering and Appplications,2011,47(22):14-15.

［10］XU Min,JING Jin.The connectivity and super connectivity of Bubble-sort graph［J］.Acta Mathematicae Applicatae Sinica,2012,35(5):789-790.