泡型图的条件匹配排除Conditional Matching Preclusion for Bubble Sort Graphs
王牟江山,王镇,王世英
摘要(Abstract)：
一个图的条件匹配排除数是最少的边的数量,使得删除这些边形成的图既没有孤立点,也没有完美匹配和几乎完美匹配.本文给出了泡型图的条件匹配排除数和它的所有最优集.
关键词(KeyWords)： 完美匹配;泡型图;条件匹配排除
基金项目(Foundation): 国家自然科学基金资助项目(61070229)
作者(Author): 王牟江山,王镇,王世英
参考文献(References)：
- [1]Brigham R C,Harary F,Violin E C,Yellen J.Perfect-matching Preclusion[J].Congressus Numerantium,2005,174:185-192.
- [2]Bondy J A,Murty U S R.Graph Theory with Applications[M].London:The Macmillan Press Ltd,1976.
- [3]王世英.一类Cayley图的边传递性和Hamilton性[J].新疆大学学报(自然科学版),1993,10(2):4-10.
- [4]Cheng E,Lesniak L,Lipman M J,Liptak L.Conditional Matching Preclusion Sets[J].Information Sciences,2009,179(8):1092-1101.
- [5]Cheng E,Lesniak L,Lipman M J,Liptak L.Matching preclusion for alternating group graphs and their generalizations[J].International Journal of Foundations of Computer Science,2008,19(6):1413-1437.
- [6]Aker S B,Krishnamurthy B.A Group Theoretic Model for Symmetric Interconnection Networks[J].IEEE Transaction onComputers,1989,38(4):555-566.
- [7]Cheng E,Liptak L.Matching Preclusion for Some Interconnection Networks[J].Networks,2007,50(2):173-180.
- [8]Bondy J A,Murty U S R.Graph Theory[M].New York:Springer,2007.
- [9]Curran Stephen J,Gallian Joseph A.Hamiltonian cycles and paths in Cayley graphs and digraphs-A survey[J].DiscreteMathematics,1996,156(1-3):1-18
- [10]Li T-K,Tan J J M,Hsu L-H.Hyper Hamiltonian Laceability on Edge Fault Star Graph[J].Information Science,2004,165(1-2):59-71.
- [11]Hsieh S-Y,Chen G-H,Ho C-W,Hamiltonian-laceability of Star Graphs[J].Networks,2000,36(4):225-232.
- [12]Park J-H,Son S H.Conditional Matching Preclusion for Hypercube-like Interconnection Networks[J].Theoretical ComputerScience,2009,410(27-29):2632-2640.
- [13]Wang Shiying,Wang Ruixia,Lin Shangwei,Li Jing.Matching preclusion for k-ary n-cubes[J].Discrete Applied Mathematics,2010,158(18):2066-2070.
- [14]Araki T,Kikuchi Y.Hamiltonian laceability of bubble-sort graphs with edge faults[J].Information Sciences,2007,177(13):2679-2691.