Premium
Reliabilities of chordal rings
Author(s) -
Hu X. D.,
Hwang F. K.
Publication year - 1992
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230220506
Subject(s) - chordal graph , interval graph , mathematics , combinatorics , ring (chemistry) , line (geometry) , reliability (semiconductor) , link (geometry) , network topology , enhanced data rates for gsm evolution , graph , discrete mathematics , topology (electrical circuits) , computer science , telecommunications , computer network , geometry , physics , power (physics) , chemistry , organic chemistry , 1 planar graph , quantum mechanics
A chordal ring is a degree‐3 regular graph with n vertices on a ring and n /2 chords determined by a parameter h . Chordal rings are attractive as topologies for computer networks due to their simple structures and short diameters. In this work, we study the reliabilities of chordal rings assuming each edge can independently fail with probability p . For p small, the usual criterion to measure the reliability of a network is its line‐connectivity. We show that all chordal rings have the same line‐connectivity and the same super line‐connectivity. We analyze the reliabilities of chordal rings by using the recently developed notions of isolated and nonisolated cutsets and list the optimal choices of h for n ≤ 30.