完整後設資料紀錄
DC 欄位語言
dc.contributor.authorLin, Cheng-Kuanen_US
dc.contributor.authorTan, Jimmy J. M.en_US
dc.contributor.authorHsu, D. Franken_US
dc.contributor.authorHsu, Lih-Hsingen_US
dc.date.accessioned2014-12-08T15:13:29Z-
dc.date.available2014-12-08T15:13:29Z-
dc.date.issued2007-08-22en_US
dc.identifier.issn0304-3975en_US
dc.identifier.urihttp://dx.doi.org/10.1016/j.tcs.2007.05.002en_US
dc.identifier.urihttp://hdl.handle.net/11536/10420-
dc.description.abstractLet u and v be any two distinct nodes of an undirected graph G, which is k-connected. For 1 <= w <= k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A w-container C(u, v) of G is a w*-container if it contains all the nodes of G. A graph G is w*-connected if there exists a w*-container between any two distinct nodes. A bipartite graph G is w*-laceable if there exists a w*-container between any two nodes from different parts of G. Let G(0) = (V-0, E-0) and G(1) = (V-1, E-1) be two disjoint graphs with vertical bar V-0 vertical bar= vertical bar V-1 vertical bar. Let E = ((v, phi(v)) vertical bar v is an element of V0, phi(v) is an element of V-1, and phi : V-0 -> V-1 is a bijection}. Let G = G(0) circle plus G(1) = (V0 boolean OR V1, E-0 boolean OR E-1 boolean OR E). The set of n-dimensional hypercube-like graph H-n(') is defined recursively as (a) H-1(') = {K2}, K2 = complete graph with two nodes, and (b) if G(0) and G(1) are in H-n', then G = G(0) circle plus G(1) is in H-n+1('). Let B-n' = {G is an element of H-n' and G is bipartite} and N-n' = H-n' B-n'. In this paper, we show that every graph in B-n' is w*-laceable for every w, 1 <= w <= n. It is shown that a constructed N-n'-graph H can not be 4*-connected. In addition, we show that every graph in N-n' is w*-connected for every w, 1 <= w <= 3. (c) 2007 Published by Elsevier B.V.en_US
dc.language.isoen_USen_US
dc.subjectHamiltonianen_US
dc.subjectHamiltonian connecteden_US
dc.subjectHamiltonian laceableen_US
dc.subjecthypercube networksen_US
dc.subjecthypercube-like networksen_US
dc.subjectomega*-connecteden_US
dc.subjectomega*-laceableen_US
dc.subjectspanning connectivityen_US
dc.subjectspanning laceabilityen_US
dc.subjectgraph containeren_US
dc.titleOn the spanning connectivity and spanning laceability of hypercube-like networksen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.tcs.2007.05.002en_US
dc.identifier.journalTHEORETICAL COMPUTER SCIENCEen_US
dc.citation.volume381en_US
dc.citation.issue1-3en_US
dc.citation.spage218en_US
dc.citation.epage229en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000248966100016-
dc.citation.woscount18-
顯示於類別:期刊論文


文件中的檔案:

  1. 000248966100016.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。