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

DOI10.1016/0020-0190(92)90192-XMaRDI QIDQ1201873zbMATH OpenFDO

Authors Krishnendu Mukhopadhyaya, Bhabani P. Sinha

Publication date 17 January 1993

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

Full work available at URL https://doi.org/10.1016/0020-0190(92)90192-X

zbMATH Keywords

distributed systemsfault-toleranceHamiltonian cycleHamiltonian graphslink failurenode failure

Mathematics Subject Classification ID

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

Recommendations

• Fault-tolerant Hamiltonicity in a class of faulty meshes
• Hamiltonicity of the torus network under the conditional fault model
• A recursively construction scheme for super fault-tolerant Hamiltonian graphs
• Hamiltonian cycles in hypercubes with more faulty edges
• Conditional fault Hamiltonicity of the complete graph

Cites work

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

Cited in

(14)

• Brother trees: A family of optimal 1p-Hamiltonian and 1-edge Hamiltonian graphs
• Globally bi-3*-connected graphs
• On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks
• Spider web networks: a family of optimal, fault tolerant, Hamiltonian bipartite graphs
• The Hamiltonian property of linear functions
• Cubic planar Hamiltonian graphs of various types
• Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
• On the construction of combined k-fault-tolerant Hamiltonian graphs
• Optimal 1-Hamiltonian graphs
• Christmas tree: a versatile 1-fault-tolerant design for token rings
• Exploration of Faulty Hamiltonian Graphs
• Construction schemes for fault-tolerant Hamiltonian graphs
• Construction of Hamiltonian cycles by recurrent neural networks in graphs of distributed computer systems
• Two construction schemes for cubic Hamiltonian 1-node-Hamiltonian graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201873)