𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On Properties of a Graph that Depend on its Distance Function

✍ Scribed by Ladislav Nebeský

Book ID
111577435
Publisher
Springer
Year
2004
Tongue
English
Weight
127 KB
Volume
54
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the degree distance of a graph
On the degree distance of a graph
✍ P. Dankelmann; I. Gutman; S. Mukwembi; H.C. Swart 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 373 KB
On the distance matrix of a directed gra
On the distance matrix of a directed graph
✍ R. L. Graham; A. J. Hoffman; H. Hosoya 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

## Abstract In this note, we show how the determinant of the distance matrix __D(G__) of a weighted, directed graph __G__ can be explicitly expressed in terms of the corresponding determinants for the (strong) blocks __G~i~__ of __G__. In particular, when cof __D(G__), the sum of the cofactors of _

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.