✦ LIBER ✦

On the average Steiner distance of graphs with prescribed properties

✍ Scribed by Peter Dankelmann; Henda C. Swart; Ortrud R. Oellermann

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 703 KB
Volume: 79
Category: Article
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(97)00035-8

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

The average Steiner distance of a graph

✍ Dankelmann, Peter; Oellermann, Ortrud R.; Swart, Henda C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB 👁 2 views

The average distance p(G) of a graph G is the average among the distances between all pairs of vertices in G. For n 2 2, the average Steiner n-distance ,4G) of a connected graph G is the average Steiner distance over all sets of n vertices in G. It is shown that for a connected weighted graph G, pu,

On cubic polyhedral graphs with prescrib

On cubic polyhedral graphs with prescribed adjacency properties of their faces

✍ Peter Smutný; Michal Tkáč 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 433 KB

We consider classes of cubic polyhedral graphs whose non-q-gonal faces are adjacent to qgonal faces only. Structural properties of some classes of such graphs are described. For q 5 we show that all the graphs in this class are cyclically 4-edge-connected. Some cyclically 4edge-connected and cyclica

On the average distance property of sphe

On the average distance property of spheres in Banach spaces

✍ Reinhard Wolf 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 297 KB

On the spectral radius of unicyclic grap

On the spectral radius of unicyclic graphs with prescribed degree sequence

✍ Francesco Belardo; Enzo M. Li Marzi; Slobodan K. Simić; Jianfeng Wang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 302 KB

On the maximum cardinality of binary con

On the maximum cardinality of binary constant weight codes with prescribed distance

✍ Cornelis de Vroedt 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 293 KB

De Vroedt, C., On the maximum cardinality of binary constant weight codes with prescribed distance, Discrete Mathematics 97 (1991) 155-160. Let A(n, d, w) be the maximum cardinality of a binary code with length n, constant weight w (0 G w < [n/2]) and Hamming distance d. In this paper a method is di

On the existence of N-connected graphs w

On the existence of N-connected graphs with prescribed degrees (n ≧ 2)

✍ D. L. Wang; D. J. Kleitman 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 648 KB