✦ LIBER ✦

On the feasible tree-diameter sets of graphs

✍ Scribed by Shimizu, T.; Shibata, Y.

Book ID: 114613909
Publisher: IEEE
Year: 1985
Weight: 243 KB
Volume: 32
Category: Article
ISSN: 0098-4094
DOI: 10.1109/tcs.1985.1085785

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On upper bounds in tree-diameter sets of

On upper bounds in tree-diameter sets of graphs

✍ Shibata, Y.; Fukue, S. 📂 Article 📅 1989 🏛 IEEE ⚖ 350 KB

On the minimum feasible graph for four s

On the minimum feasible graph for four sets

✍ Yinfeng Xu; Xiaobing Fu 📂 Article 📅 1995 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 245 KB

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

On the Diameter of Wenger Graphs

✍ Raymond Viglione 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 195 KB

On the Erdős-diameter of sets

✍ Peter Brass 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Diameter of random spanning trees in a g

Diameter of random spanning trees in a given graph

✍ Fan Chung; Paul Horn; L. Lu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Motivated by the observation that the sparse tree‐like subgraphs in a small world graph have large diameter, we analyze random spanning trees in a given host graph. We show that the diameter of a random spanning tree of a given host graph __G__ is between and with high probability., w