𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the fault-tolerant diameter and wide diameter of ω-connected graphs

✍ Scribed by Jian-Hua Yin; Jiong-Sheng Li; Guo-Liang Chen; Cheng Zhong

Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
179 KB
Volume
45
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the connectivity and the conditional
On the connectivity and the conditional diameter of graphs and digraphs
✍ Balbuena, C.; Carmona, A.; F�brega, J.; Fiol, M. A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 771 KB

Recently, it was proved that if the diameter D of a graph G is small enough in comparison with its girth, then G is maximally connected and that a similar result also holds for digraphs. More precisely, if the diameter D of a digraph G satisfies D 5 21 -1, then G has maximum connectivity ( K = 6 ) .

On the spanning w-wide diameter of the s
On the spanning w-wide diameter of the star graph
✍ Cheng-Kuan Lin; Hua-Min Huang; D. Frank Hsu; Lih-Hsing Hsu 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 402 KB

## Abstract Let __u__ and __v__ be any two distinct nodes of an undirected graph __G__, which is __k__‐connected. A container __C__(__u__,__v__) between __u__ and __v__ is a set of internally disjoint paths {__P__~1~,__P__~2~,…,__P__~__w__~} between __u__ and __v__ where 1 ≤ __w__ ≤ __k__. The widt

On the superconnectivity and the conditi
On the superconnectivity and the conditional diameter of graphs and digraphs
✍ Carmona, A.; F�brega, J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

It has been proved that if the diameter D of a digraph G satisfies D Յ 2ᐉ Ϫ 2, where ᐉ is a parameter which can be thought of as a generalization of the girth of a graph, then G is superconnected. Analogously, if D Յ 2ᐉ Ϫ 1, then G is edge-superconnected. In this paper, we studied some similar condi

On the Spectrum, the Growth, and the Dia
On the Spectrum, the Growth, and the Diameter of a Graph
✍ N. Hajaj 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 171 KB

A lower bound is given for the harmonic mean of the growth in a finite undirected graph 1 in terms of the eigenvalues of the Laplacian of 1. For a connected graph, this bound is tight if and only if the graph is distance-regular. Bounds on the diameter of a ``sphere-regular'' graph follow. Finally,