Fault tolerant token ring embedding in double loop networks.

DOI10.1016/S0020-0190(98)00066-0zbMATH Open1078.68585OpenAlexW2060423228MaRDI QIDQ2583564FDOQ2583564

Authors: Ting-Yi Sung, Chun-Yuan Lin, Yen-Chu Chuang, Lih-Hsing Hsu 

Publication date: 17 January 2006

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

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00066-0

zbMATH Keywords

Hamiltonian cycleFault toleranceDouble loop network

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Circulants and their connectivities
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reliability comparison of token-ring network schemes

Cited In (5)

• Fault-Hamiltonicity of Cartesian products of directed cycles
• On some super fault-tolerant Hamiltonian graphs
• Title not available (Why is that?)
• Panconnectivity for interconnection networks with faulty elements
• ON MINIMAL VERTEX 1-EXTENSIONS OF PATH ORIENTATION

This page was built for publication: Fault tolerant token ring embedding in double loop networks.

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