2002
DOI: 10.1016/s0020-0190(02)00310-1
|View full text |Cite
|
Sign up to set email alerts
|

Ring embedding in faulty honeycomb rectangular torus

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
10
0
1

Year Published

2004
2004
2010
2010

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 10 publications
0
10
0
1
Order By: Relevance
“…A family of trivalent vertex-transitive graphs that have garnered attention over the last thirty-five years have been called brick products in [1,2,5], honeycomb tori in [8,9,12,13,14,15], honeycomb toroidal graphs in [3], and hexagonal toroidal embeddings in [6,11]. Altshuler [6] studied them when he was considering Hamilton cycles in graphs embedded in the torus.…”
Section: Introductionmentioning
confidence: 99%
“…A family of trivalent vertex-transitive graphs that have garnered attention over the last thirty-five years have been called brick products in [1,2,5], honeycomb tori in [8,9,12,13,14,15], honeycomb toroidal graphs in [3], and hexagonal toroidal embeddings in [6,11]. Altshuler [6] studied them when he was considering Hamilton cycles in graphs embedded in the torus.…”
Section: Introductionmentioning
confidence: 99%
“…A graph G is hamiltonian if there exists a hamiltonian cycle in G. The hamiltonian properties are important aspects of designing an interconnection network. Many related works have appeared in the literature [3,6,8,12,13].…”
Section: Introductionmentioning
confidence: 99%
“…There are many studies on the properties of the honeycomb rectangular torus [3,8,11]. Stojmenovic [11] showed that the network cost of the honeycomb rectangular torus, which is defined as the product of degree and the diameter, is better than the other families based on mesh-connected computers and tori.…”
Section: Introductionmentioning
confidence: 99%
“…Stojmenovic [9] proposed three classes of honeycomb torus architectures: honeycomb hexagonal torus, honeycomb rectangular torus, and honeycomb parallelogramic torus. Due to lower node degree and lower implementation cost than those of a standard torus of the same size, these architectures have incurred great research interest [1,2,5,6,[8][9][10][11]. Cho and Hsu [3] found that all these honeycomb torus networks can be characterized in a unified way, and thereby proposed a class of interconnection networks known as the generalized honeycomb torus.…”
Section: Introductionmentioning
confidence: 99%
“…Megson et al [5,6] proved that hon-eycomb hexagonal torus is Hamiltonian, even in the presence of node failures. Cho and Hsu [2] discovered a Hamiltonian cycle for faulty honeycomb rectangular torus. As for generalized honeycomb torus, Cho and Hsu [3], and Yang and Megson [12] proved the existence of Hamiltonian cycles for some special cases.…”
Section: Introductionmentioning
confidence: 99%