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


Jung-Hwan Chang, Journal of Information Processing Systems Vol. 7, No. 1, pp. 75-84, Feb. 2011

10.3745/JIPS.2011.7.1.075
Keywords: Enhanced Pyramid Model, Hamiltonian Cycle, Edge-Disjoint Cycle
Fulltext:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 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
[APA Style]
Jung-Hwan Chang (2011). An Embedding of Multiple Edge-Disjoint Hamiltonian Cycles on Enhanced Pyramid Graphs. Journal of Information Processing Systems, 7(1), 75-84. DOI: 10.3745/JIPS.2011.7.1.075 .

[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 .