Hamiltonian-laceability of star graphs

Sun-Yuan Hsieh, Gen Huey Chen, Chin Wen Ho

研究成果: Paper同行評審

6 引文 斯高帕斯(Scopus)

摘要

Suppose G is a bipartite graph with two partite sets of equal size. G is said to be strongly hamiltonian-laceable if there is a hamiltonian path between every two vertices that belong to different partite sets, and there is a path of (maximal) length N-2 between every two vertices that belong to the same partite set, where N is the order of G. The star graph is known to be bipartite. In this paper, we show that the n-dimensional star graph, where n≥4 is strongly hamiltonian-laceable.

原文English
頁面112-117
頁數6
DOIs
出版狀態Published - 1997 一月 1
事件3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997 - Taipei, Taiwan
持續時間: 1997 十二月 181997 十二月 20

Conference

Conference3rd International Symposium on Parallel Architectures, Algorithms, and Networks, I-SPAN 1997
國家Taiwan
城市Taipei
期間97-12-1897-12-20

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

指紋 深入研究「Hamiltonian-laceability of star graphs」主題。共同形成了獨特的指紋。

引用此