Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II: Grids and k-fault-tolerance
DOI10.1007/S10513-005-0055-8zbMATH Open1076.90057OpenAlexW2073516056MaRDI QIDQ2487499FDOQ2487499
Authors: M. F. Karavai 
Publication date: 8 August 2005
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10513-005-0055-8
Recommendations
- Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
- scientific article; zbMATH DE number 861306
- scientific article; zbMATH DE number 1256708
- Designing fault-tolerant systems using automorphisms
- Construction schemes for fault-tolerant Hamiltonian graphs
Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Reliability, testing and fault tolerance of networks and computer systems (68M15) Fault detection; testing in circuits and networks (94C12) Applications of graph theory to circuits and networks (94C15) Network design and communication in computer systems (68M10)
Cites Work
Cited In (5)
- On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
- Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. I: One-fault-tolerant structures
- Using the redundant chords of the \(k\)-fault-tolerant graph to eliminate the effect of failed components
- Design of the EPLD-based reconfigurable fault-tolerant systems with cell-level redundancy
- Transformation of grids to 1-fault-tolerant graphs
This page was built for publication: Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II: Grids and \(k\)-fault-tolerance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487499)
