𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average connectivity and average edge-connectivity in graphs

✍ Scribed by Kim, Jaehoon; O, Suil

Book ID
121210819
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
379 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Average Distance and Edge-Connectivity I
Average Distance and Edge-Connectivity I
✍ Dankelmann, Peter; Mukwembi, Simon; Swart, Henda C. πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 171 KB
Average Distance and Edge-Connectivity I
Average Distance and Edge-Connectivity II
✍ Dankelmann, Peter; Mukwembi, Simon; Swart, Henda C. πŸ“‚ Article πŸ“… 2008 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 317 KB
Average distance and vertex-connectivity
Average distance and vertex-connectivity
✍ Peter Dankelmann; Simon Mukwembi; Henda C. Swart πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 202 KB

## Abstract The average distance Β΅(__G__) of a connected graph __G__ of order __n__ is the average of the distances between all pairs of vertices of __G__, i.e., $\mu(G)=\left(\_{2}^{n}\right)^{-1}\sum\_{\{x,y\}\subset V(G)}d\_{G} (x,y)$, where __V__(__G__) denotes the vertex set of __G__ and __d_

Edge-connectivity in -path graphs
Edge-connectivity in -path graphs
✍ C. Balbuena; P. GarcΓ­a-VΓ‘zquez πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 184 KB