On k-step Hamiltonian graphs

For integers k 1, a (p, q)-graph G = (V, E) is said to admit an AL(k)-traversal if there exists a sequence of vertices (v1, v 2,. . .,vp) such that for each i = 1, 2, . . . , p - 1, the distance between vi and vi is k. We call a graph ¿-step Hamiltonian (or say it admits a k-step Hamiltonian tour) i...

詳細記述

書誌詳細
出版年:Journal of Combinatorial Mathematics and Combinatorial Computing
第一著者: Lau G.-C.; Lee S.-M.; Schaffer K.; Tong S.-M.; Lui S.
フォーマット: 論文
言語:English
出版事項: Charles Babbage Research Centre 2014
オンライン・アクセス:https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906237290&partnerID=40&md5=f50a42137bc62bf7addb2626bb190766

類似資料