๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the diameters of spanning trees

โœ Scribed by Sankaran, V.; Krishnamoorthy, V.

Book ID
114613766
Publisher
IEEE
Year
1985
Weight
344 KB
Volume
32
Category
Article
ISSN
0098-4094

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Minimum restricted diameter spanning tre
Minimum restricted diameter spanning trees
โœ Refael Hassin; Asaf Levin ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 304 KB

Let G = (V; E) be a requirement graph. Let d = (dij) n i; j=1 be a length metric. For a tree T denote by dT (i; j) the distance between i and j in T (the length according to d of the unique i -j path in T ). The restricted diameter of T , DT , is the maximum distance in T between pair of vertices wi

A note on graphs with diameter-preservin
A note on graphs with diameter-preserving spanning trees
โœ Fred Buckley; Martin Lewinter ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 182 KB ๐Ÿ‘ 1 views

The distance between a pair of vertices u, u in a graph G is the length of a shortest path joining u and u. The diameter diam(G) of G is the maximum distance between all pairs of vertices in G. A spanning tree Tof G is diameter preserving if diam(T) = diam(G). In this note, we characterize graphs th