The Pancyclic Property of Pyramid Graphs


The KIPS Transactions:PartA, Vol. 15, No. 2, pp. 119-124, Apr. 2008
10.3745/KIPSTA.2008.15.2.119,   PDF Download:

Abstract

In this paper, we analyze a cycle property embedded in pyramid graphs. We prove that it is always possible to construct diverse cycles of all lengths from 3 to (4N-1)/3 by applying series of cycle expansion operations to the pyramid graph of height N. This means that the pyramid graph has the pancyclic property.


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, "The Pancyclic Property of Pyramid Graphs," The KIPS Transactions:PartA, vol. 15, no. 2, pp. 119-124, 2008. DOI: 10.3745/KIPSTA.2008.15.2.119.

[ACM Style]
Jung Hwan Chang. 2008. The Pancyclic Property of Pyramid Graphs. The KIPS Transactions:PartA, 15, 2, (2008), 119-124. DOI: 10.3745/KIPSTA.2008.15.2.119.