Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

DOI10.1016/0020-0190(92)90192-XzbMath0768.68002MaRDI QIDQ1201873

Bhabani P. Sinha, Krishnendu Mukhopadhyaya

Publication date: 17 January 1993

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

zbMATH Keywords

distributed systemsHamiltonian cyclefault-tolerancenode failureHamiltonian graphslink failure

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07) Reliability, testing and fault tolerance of networks and computer systems (68M15) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

Optimal 1-Hamiltonian graphs ⋮ Christmas tree: a versatile 1-fault-tolerant design for token rings ⋮ On the construction of combinedk-fault-tolerant Hamiltonian graphs ⋮ Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs ⋮ Construction schemes for fault-tolerant Hamiltonian graphs ⋮ Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs ⋮ Cubic planar Hamiltonian graphs of various types ⋮ Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs ⋮ Brother trees: A family of optimal \(1p\)-Hamiltonian and 1-edge Hamiltonian graphs ⋮ Globally bi-3*-connected graphs

Cites Work

• Properties of a class of trivalent network graphs and optimal routing
• Dense Trivalent Graphs for Processor Interconnection
• A Fault-Tolerant Communication Architecture for Distributed Systems

This page was built for publication: Hamiltonian graphs with minimum number of edges for fault-tolerant topologies