𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average Distance and Edge-Connectivity I

✍ Scribed by Dankelmann, Peter; Mukwembi, Simon; Swart, Henda C.

Book ID
118196940
Publisher
Society for Industrial and Applied Mathematics
Year
2008
Tongue
English
Weight
171 KB
Volume
22
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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_

Degree distance and vertex-connectivity
Degree distance and vertex-connectivity
✍ Ali, P.; Mukwembi, S.; Munyira, S. πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 310 KB
Antisymmetric flows and edge-connectivit
Antisymmetric flows and edge-connectivity
✍ Matt DeVos; Jaroslav NeΕ‘etΕ™il; AndrΓ© Raspaud πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 205 KB