標題: Honeycomb rectangular disks
作者: Teng, YH
Tan, JJM
Hsu, LH
資訊工程學系
Department of Computer Science
關鍵字: hamiltonian;honeycomb mesh
公開日期: 1-三月-2005
摘要: In this paper, we propose a variation of honeycomb meshes. A honeycomb rectangular disk HReD(m,n) is obtained from the honeycomb rectangular mesh HReM(m,n) by adding a boundary cycle. A honeycomb rectangular disk HReD(m,n) is a 3-regular planar graph. It is obvious that the honeycomb rectangular mesh HReM(m,n) is a subgraph of HReD(m,n). We also prove that HReD(m,n) is hamiltonian. Moreover, HReD(m,n) -f remains hamiltonian for any f is an element of V(HReD(m, n)) boolean OR E(HReD(m, n)) if n >= 6. (c) 2005 Elsevier B.V. All rights reserved.
URI: http://dx.doi.org/10.1016/j.parco.2004.12.002
http://hdl.handle.net/11536/13985
ISSN: 0167-8191
DOI: 10.1016/j.parco.2004.12.002
期刊: PARALLEL COMPUTING
Volume: 31
Issue: 3-4
起始頁: 371
結束頁: 388
顯示於類別:期刊論文


文件中的檔案:

  1. 000229709100007.pdf

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