Hamiltonian-laceability of star graphs

Sun Yuan Hsieh, Gen Huey Chen, Chin Wen Ho

研究成果: Article同行評審

87 引文 斯高帕斯(Scopus)

摘要

Suppose that G is a bipartite graph with its 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. In other words, a strongly Hamiltonian-laceable graph has a longest path between every two of its vertices. In this paper, we show that the star graphs with dimension four or larger are strongly Hamiltonian-laceable.

原文English
頁(從 - 到)225-232
頁數8
期刊Networks
36
發行號4
DOIs
出版狀態Published - 2000 12月

All Science Journal Classification (ASJC) codes

  • 軟體
  • 資訊系統
  • 硬體和架構
  • 電腦網路與通信

指紋

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

引用此