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

DOI10.1080/00207160903315524zbMath1214.68086OpenAlexW2032689273MaRDI QIDQ3066979

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

Publication date: 20 January 2011

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160903315524

zbMATH Keywords

Hamiltonian cycleinterconnection networksfault-tolerancegraph embeddinggeneralized honeycomb torus

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Ubiquitous integrity via network integration and parallelism-sustaining pedestrian/bike urbanism

Cites Work

• Diameter of parallelogramic honeycomb torus
• Generalized honeycomb torus is Hamiltonian
• Generalized honeycomb torus
• Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs
• Honeycomb tori are Hamiltonian
• A semantics of sequence diagrams.
• Vertex-bipancyclicity of the generalized honeycomb tori

This page was built for publication: Ring embedding in faulty generalized honeycomb torus – GHT(m, n, n/2)