An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs

Jung-Hwan Chang
Volume: 7, No: 1, Page: 75 ~ 84, Year: 2011
10.3745/JIPS.2011.7.1.075
Keywords: Enhanced Pyramid Model, Hamiltonian Cycle, Edge-Disjoint Cycle
Full Text:

Abstract
The enhanced pyramid graph was recently proposed as an interconnection network model in parallel processing for maximizing regularity in pyramid networks. We prove that there are two edge-disjoint Hamiltonian cycles in the enhanced pyramid networks. This investigation demonstrates its superior property in edge fault tolerance. This result is optimal in the sense that the minimum degree of the graph is only four.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
J. Chang, "An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs," Journal of Information Processing Systems, vol. 7, no. 1, pp. 75~84, 2011. DOI: 10.3745/JIPS.2011.7.1.075 .

ACM Style
Jung-Hwan Chang. 2011. An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs, Journal of Information Processing Systems, 7, 1, (2011), 75~84. DOI: 10.3745/JIPS.2011.7.1.075 .