𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A kind of conditional vertex connectivity of star graphs

✍ Scribed by Min Wan; Zhao Zhang

Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
380 KB
Volume
22
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

✦ Synopsis

In this work, we prove that ΞΊ 2 (S n ) = 6(n -3) for n β‰₯ 4, where S n is the n-dimensional star graph.

πŸ“œ SIMILAR VOLUMES

On strong Menger-connectivity of star gr
On strong Menger-connectivity of star graphs
✍ Eunseuk Oh; Jianer Chen πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 415 KB

Motivated by parallel routing in networks with faults, we study the following graph theoretical problem. Let G be a graph of minimum vertex degree d. We say that G is strongly Menger-connected if for any copy G f of G with at most d -2 nodes removed, every pair of nodes u and v in G f are connected

Maximal vertex-connectivity of
Maximal vertex-connectivity of
✍ Eddie Cheng; William A. Lindsey; Daniel E. Steffy πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 172 KB
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 ) .