Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs

DOI10.1016/S0020-0190(02)00509-4zbMath1162.68499MaRDI QIDQ1007617

Shin-Shin Kao, Lih-Hsing Hsu

Publication date: 23 March 2009

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Hamiltoniandiameterinterconnection networkscomplete binary tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Ring embedding in faulty generalized honeycomb torus – GHT(m, n, n/2) ⋮ Globally bi-3*-connected graphs ⋮ Constructions of Hamiltonian graphs with bounded degree and diameter \(O(\log n)\) ⋮ The globally bi-\(3^*\) and hyper bi-\(3^*\) connectedness of the spider web networks

Cites Work

• Unnamed Item
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Embedding a ring in a hypercube with both faulty links and faulty nodes
• Hamiltonian graphs with minimum number of edges for fault-tolerant topologies
• Parallel concepts in graph theory
• Ring embedding in faulty honeycomb rectangular torus.