𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A distinct distance set of 9 nodes in a tree of diameter 36

✍ Scribed by Herbert Taylor

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
151 KB
Volume
93
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Taylor, H., A distinct distance set of 9 nodes in a tree of diameter 36, Discrete Mathematics 93 (1991) 167-168.

πŸ“œ SIMILAR VOLUMES

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

Vertices contained in every minimum domi
Vertices contained in every minimum dominating set of a tree
✍ Mynhardt, C. M. πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 321 KB

In this article we begin the study of the vertex subsets of a graph G which consist of the vertices contained in all, or in no, respectively, minimum dominating sets of G. We characterize these sets for trees, and also obtain results on the vertices contained in all minimum independent dominating se