https://scholars.lib.ntu.edu.tw/handle/123456789/488236
標題: | Hamiltonian-laceability of star graphs. | 作者: | Hsieh, Sun-Yuan Ho, Chin-Wen GEN-HUEY CHEN |
關鍵字: | Bipartite graph; Hamiltonian path; Hamiltonian-laceability; Longest path; Star graph | 公開日期: | 2000 | 卷: | 36 | 期: | 4 | 起(迄)頁: | 225-232 | 來源出版物: | Networks | 摘要: | 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. © 2000 John Wiley & Sons, Inc. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0034393290&doi=10.1002%2f1097-0037%28200012%2936%3a4%3c225%3a%3aAID-NET3%3e3.0.CO%3b2-G&partnerID=40&md5=ae49a039655e465b8284914c969a2c3f | DOI: | 10.1002/1097-0037(200012)36:4<225 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。