標題: Spider web networks: a family of optimal, fault tolerant, hamiltoman bipartite graphs
作者: Kao, SS
Hsu, LH
資訊工程學系
Department of Computer Science
關鍵字: bipartite;1-edge hamiltonian;1(p)-hamiltonian;optimal
公開日期: 5-一月-2005
摘要: In this paper, we propose a honeycomb mesh variation, called a spider web network. Assume that in and it are positive even integers with m greater than or equal to 4. A spider web network SW(m, n) is a 3-regular bipartite planar graph with bipartition C and D. We prove that the honeycomb rectangular mesh HREM(m, n) is a spanning subgraph of SW(m, n). We also prove that SW(m, n) - e is harniltonian for any e is an element of E and SW(m, n) - {c, d} remains hamiltonian for any c is an element of C and d is an element of D. These hamiltonian propel-ties are optimal. (C) 2003 Elsevier Inc. All rights reserved.
URI: http://dx.doi.org/10.1016/j.amc.2003.06.005
http://hdl.handle.net/11536/24260
ISSN: 0096-3003
DOI: 10.1016/j.amc.2003.06.005
期刊: APPLIED MATHEMATICS AND COMPUTATION
Volume: 160
Issue: 1
起始頁: 269
結束頁: 282
顯示於類別:期刊論文


文件中的檔案:

  1. 000225269700023.pdf

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