On average connectivity of the strong product of graphs
✍ Scribed by Abajo, E.; Casablanca, R.M.; Diánez, A.; García-Vázquez, P.
- Book ID
- 123182642
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 407 KB
- Volume
- 161
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
In this paper, we consider the concept of the average connectivity of a graph, deÿned to be the average, over all pairs of vertices, of the maximum number of internally disjoint paths connecting these vertices. We establish sharp bounds for this parameter in terms of the average degree and improve o