完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHung, Chun-Nan Jr
dc.contributor.authorLin, Yu-Chun Jr
dc.date.accessioned2011-02-21T23:26:58Z
dc.date.accessioned2020-05-18T03:22:01Z-
dc.date.available2011-02-21T23:26:58Z
dc.date.available2020-05-18T03:22:01Z-
dc.date.issued2011-02-21T23:26:58Z
dc.date.submitted2009-11-27
dc.identifier.urihttp://dspace.lib.fcu.edu.tw/handle/2377/30025-
dc.description.abstractA bipartite graph G = (V,E) edgebipancyclic if every edge lies on the cycles of every even length from 4 to |V |. Let Qn = (Vb [ Vw,E) be an n- dimensional hypercube where Vb and Vw are the sets of black and white vertices, respectively. Let Fb (resp. Fw) be the set of black (resp. white) faulty vertices. In this paper, we will show that Qn − Fb − Fw is edge-bipancyclic if |Fb|, |Fw| bn−1 4 c.
dc.description.sponsorshipNational Taipei University,Taipei
dc.format.extent9p.
dc.relation.ispartofseriesNCS 2009
dc.subjecthypercube
dc.subjectedge-bipancyclic
dc.subjectbipartite graph
dc.subjectvertices fault-tolerance
dc.subject.otherWorkshop on Algorithms and Bioinformatics
dc.titleVertex fault tolerance for edge-bipancyclicity of hypercube
分類:2009年 NCS 全國計算機會議

文件中的檔案:
檔案 描述 大小格式 
AB 1-1.pdf466.49 kBAdobe PDF檢視/開啟


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。