𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degree distance and vertex-connectivity

✍ Scribed by Ali, P.; Mukwembi, S.; Munyira, S.

Book ID
120631585
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
310 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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_

On the vertex degree indices of connecte
On the vertex degree indices of connected graphs
✍ Tomislav DoΕ‘liΔ‡; TamΓ‘s RΓ©ti; Damir VukičeviΔ‡ πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 219 KB
The vertex connectivity of a {0, 2}-grap
The vertex connectivity of a {0, 2}-graph equals its degree
✍ A.E. Brouwer; H.M. Mulder πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 140 KB

The first author observed that nice graphs are regular and have vertex connectivity equal to the degree. The second author observed that {0,2}-graphs are nice. This note follows immediately. A {0, 2}-graph is a connected graph such that any two distinct vertices have either 0 or 2 common neighbours