𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Average distance in graphs with removed elements

✍ Scribed by D. Bienstock; E. Györi

Book ID
102892530
Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
634 KB
Volume
12
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Average distance in colored graphs
Average distance in colored graphs
✍ Peter Dankelmann; Wayne Goddard; Peter Slater 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

## Abstract For a graph __G__ where the vertices are colored, the __colored distance__ of __G__ is defined as the sum of the distances between all unordered pairs of vertices having different colors. Then for a fixed supply __s__ of colors, __d~s~(G)__ is defined as the minimum colored distance ove

On the average Steiner distance of graph
On the average Steiner distance of graphs with prescribed properties
✍ Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 703 KB

The average n-distance of a connected graph G, p,,(G), is the average of the Steiner distances of all n-sets of vertices of G. In this paper, we give bounds on pn for two-connected graphs and for k-chromatic graphs. Moreover, we show that pn(G) does not depend on the n-diameter of G.