並列摘要
In this paper, we prove the recently proposed family of bipartite graphs, Spider Web Networks [9], are hamiltonian laceable. More precisely, let G=(V, E) be a spider web network with bipartitions C and D. For any pair of nodes {x, y| x∈C, y∈D}, there is a path P between x and y where P visits all nodes in V exactly once.
延伸閱讀
- 黃敬仁、廖麗滿（2007）。疏鬆耦合式網路協同設計之系統雛型建置。勤益學報，(25)，M-1-M-19。https://doi.org/10.6753/CYJ.200712.0016
- Chuang, H. C. (2008). 共軛立方延伸網路之相互獨立漢米爾頓迴圈 [master's thesis, Chung Yuan Christian University]. Airiti Library. https://doi.org/10.6840/cycu200800365
- Chang, W. K., & Hon, S. K. (2000). 網際網路環境架構下超連結正確性驗證的自動測試. 東海科學, (2), 1-19. https://doi.org/10.29723/TS.200007.0001
- 黃建誠、賴守全、莊育秀（2017）。多層次網路連通率量測分析探討。載於東海大學（主編），TANET2017 臺灣網際網路研討會（頁1410-1414）。東海大學。https://doi.org/10.6728/TANET.201710.0246
- Chuang, T. Y. (2016). 網路結構資料之認知 [doctoral dissertation, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201603280