Ring embedding in faulty generalized honeycomb torus - GHT(m, n, n/2)

Li Yen Hsu*, Feng I. Ling, Shin Shin Kao, Hsun-Jung Cho

*Corresponding author for this work

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

The honeycomb torus HT(m) is an attractive architecture for distributed processing applications. For analysing its performance, a symmetric generalized honeycomb torus, GHT(m, n, n/2), with m≥2 and even n≥4, where m+n/2 is even, which is a 3-regular, Hamiltonian bipartite graph, is operated as a platform for combinatorial studies. More specifically, GHT(m, n, n/2) includes GHT(m, 6, 3m), the isomorphism of the honeycomb torus HT(m). It has been proven that any GHT(m, n, n/2)-e is Hamiltonian for any edge eE(GHT(m, n, n/2)). Moreover, any GHT(m, n, n/2)-F is Hamiltonian for any F={u, v} with uB and vW, where B and W are the bipartition of V(GHT(m, n, n/2)) if and only if n≥6 or m=2, n≥4.

Original languageEnglish
Pages (from-to)3344-3358
Number of pages15
JournalInternational Journal of Computer Mathematics
Volume87
Issue number15
DOIs
StatePublished - 1 Dec 2010

Keywords

  • fault-tolerance
  • generalized honeycomb torus
  • graph embedding
  • Hamiltonian cycle
  • interconnection networks

Fingerprint Dive into the research topics of 'Ring embedding in faulty generalized honeycomb torus - GHT(m, n, n/2)'. Together they form a unique fingerprint.

Cite this