Transformation of grids to 1-fault-tolerant graphs

zbMATH Open1448.68362MaRDI QIDQ5117040FDOQ5117040

V. G. Skobelev, I. A. Naumenko

Publication date: 20 August 2020

Full work available at URL: http://mathnet.ru/eng/pdm18

Recommendations

• Minimized embedding of arbitrary Hamiltonian graphs in fault-tolerant graph and reconfiguration at faults. II: Grids and \(k\)-fault-tolerance
• Largest component and node fault tolerance for grids
• Faithful 1-edge fault tolerant graphs
• scientific article; zbMATH DE number 861431
• Edge fault tolerance in graphs

Mathematics Subject Classification ID

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

Cited In (1)

• On efficient connectivity-preserving transformations in a grid

This page was built for publication: Transformation of grids to 1-fault-tolerant graphs

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