𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reliability analysis of circulant graphs

✍ Scribed by Li, Qiaoliang; Li, Qiao

Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
82 KB
Volume
31
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

✦ Synopsis

The circulant graphs are of particular interest as models of communication networks. In this work, we present new reliability analysis results for circulants based on the concept of restricted edge connectivity, which generalizes the super-l property of a graph. We evaluate the restricted edge connectivity l and the number of i-cutsets N i (G), l Β°i Γ΅ l, for any circulant graph explicitly. This improves the previous results on the subject.

πŸ“œ SIMILAR VOLUMES

Pancyclicity of connected circulant grap
Pancyclicity of connected circulant graphs
✍ Bogdanowicz, Z. R. πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 299 KB πŸ‘ 1 views

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi

Reliability analysis of replicated and-o
Reliability analysis of replicated and-or graphs
✍ Liang, De-Ron; Jan, Rong-Hong; Tripathi, Satish K. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 155 KB πŸ‘ 1 views

A computation task running in distributed systems can be represented as a directed graph H(V, E) whose vertices and edges may fail with known probabilities. In this paper, we introduce a reliability measure, called the distributed task reliability, to model the reliability of such computation tasks.

Reliability analysis of aeroplane brakes
Reliability analysis of aeroplane brakes
✍ Ahmed Z. Al-Garni; Ahmet Z. Sahin; Abdulrahim S. Al-Ghamdi; Saif A. Al-Kaabi πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 1 views
On the asymptotic behavior of the maximu
On the asymptotic behavior of the maximum number of spanning trees in circulant graphs
✍ Lonc, Zbigniew; Parol, Krzysztof; Wojciechowski, Jacek M. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

The following asymptotic estimation of the maximum number of spanning trees f k (n) in 2kregular circulant graphs ( k ΓΊ 1) on n vertices is the main result of this paper: )) , where