[1] 徐俊明.组合网络理论[M].北京:科学出版社,2007.[2] Yang MingChien.Cycle embedding in star graphs with conditional edge faults[J]. Applied Mathematics and computation,2010,215:3541-3546.[3] Eddie,Jerrold W. Distance formula and shortest paths for the (n,k)star graphs[J]. Information Sciences,2010,180: 1671-1680.[4] Lin T C,DyiRongDuh.Constructing vertexdisjoint paths in (n,k)star graphs[J].Information Sciences,2008,178:788-801.[5] Xiang Y H ,Stewart Iain A.Onetomany nodedisjoint paths in (n,k)star graphs[J]. Discret Applied Mathematics ,2010,158:32-70. [6] Li TsengKuei , Tan Jimmy J M,Hsu LihHsing . Hyper hamiltonian laceability on edge fault star graph[J]. Information Sciences,2004,165: 59-71. [7] Hsieh S Y, Chen G H, Ho C W. Longest faultfree paths in Star graphs with edge faults[J]. IEEE Trans. Comput,2001,50: 960-971.[8] Chen Y Y, Duh D R, Ye T L, et al. Weakvertexpancyclicity of (n,k)star graphs[J]. Theoretical Computer Science,2008,396: 191-199.[9] Chiang W K, Chen R J.The (n,k)star graph:An generalized star graph[J].Information Processing Letters,1995,56:259-264.[10]Chiang W K, Chen R J.Topogical properties of the (n,k)star graph[J].International Journal of Foundations of Science,1998,9:235-248. |