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...
類似資料
-
A complete solution of 3-step hamiltonian grids and torus graphs
著者:: Lau G.-C.; Lee S.-M.; Schaffer K.; Tong S.-M.
出版事項: (2019) -
On Bridge Graphs with Local Antimagic Chromatic Number 3
著者:: Shiu W.-C.; Lau G.-C.; Zhang R.
出版事項: (2025) -
On Bridge Graphs with Local Antimagic Chromatic Number 3
著者:: Shiu, 等
出版事項: (2025) -
Making Sense of Line Graph
著者:: 2-s2.0-105000066787
出版事項: (2025) -
Step Length Classification Using Decision Tree Based on IMU Sensors and Body Height
著者:: Zaeni I.A.E.; Lestari D.; Mustika S.N.; Rif'a Anzani D.; Osman M.K.; Ahmad K.A.
出版事項: (2024)