A Hamiltonian Property of Pyramid Graphs


The KIPS Transactions:PartA, Vol. 13, No. 3, pp. 253-260, Jun. 2006
10.3745/KIPSTA.2006.13.3.253,   PDF Download:

Abstract

In this paper, we analyze the Hamiltonian property of Pyramid graphs. We prove that it is always possible to construct a Hamiltonian cycle of length (4N-1)/3 by applying the proposed algorithm to construct series of cycle expansion operations into two adjacent cycles in the Pyramid graph of height N.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
J. H. Chang, "A Hamiltonian Property of Pyramid Graphs," The KIPS Transactions:PartA, vol. 13, no. 3, pp. 253-260, 2006. DOI: 10.3745/KIPSTA.2006.13.3.253.

[ACM Style]
Jung Hwan Chang. 2006. A Hamiltonian Property of Pyramid Graphs. The KIPS Transactions:PartA, 13, 3, (2006), 253-260. DOI: 10.3745/KIPSTA.2006.13.3.253.