A Study on the Induced Dominating Path of Honeycomb Meshes
碩士 === 國立臺灣科技大學 === 資訊管理系 === 90 === Honeycomb meshes are a variation of mesh networks. In this thesis, we focus on the honeycomb hexagon mesh that is a honeycomb mesh wirh hexagons. An induced dominating path is an induced path that dominates every vertex in a honeycomb hexagon mesh. By...
Main Author: | 徐俊雄 |
---|---|
Other Authors: | 王有禮 |
Format: | Others |
Language: | zh-TW |
Published: |
2002
|
Online Access: | http://ndltd.ncl.edu.tw/handle/91193364098971695692 |
Similar Items
-
An Algorithm for Solving the Power Domination Problem on Honeycomb Meshes
by: Shuo-Hong Xu, et al.
Published: (2009) -
The Incidence Coloring Algorithm for Honeycomb Meshes, Square Meshes and Hexagonal Meshes
by: Sheng-Hsiung, Chung, et al.
Published: (2003) -
HIGH-ORDER FINITE ELEMENTS FOR THE NEUTRON TRANSPORT EQUATION ON HONEYCOMB MESHES
by: Calloo Ansar, et al.
Published: (2021-01-01) -
One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks
by: Jung-Hyun Seo, et al.
Published: (2011-02-01) -
The decision of Hamiltonian path in Mesh
by: Yau-Yang Tasi, et al.
Published: (2008)