Hamiltonicity of Matching Composition Networks with Conditional Edge Faults

DOI10.1007/978-3-540-79228-4_14zbMath1139.68325OpenAlexW1549458716MaRDI QIDQ3502642

Sun-Yuan Hsieh, Chia-Wei Lee

Publication date: 27 May 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79228-4_14

zbMATH Keywords

graph theoryHamiltonian cyclesHamiltonicityfault-tolerancemultiprocessor systemsmatching composition networksconditional edge faultsrestricted hypercube-like networksAlgorithmic aspects of network problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model

This page was built for publication: Hamiltonicity of Matching Composition Networks with Conditional Edge Faults