𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bounded Contractions of Full Trees

✍ Scribed by Amnon Barak; Ron Ben-Natan

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
478 KB
Volume
17
Category
Article
ISSN
0743-7315

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A class of full Steiner minimal trees
A class of full Steiner minimal trees
✍ F.K. Hwang; Jia Feng Weng; Ding Zhu Du πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 559 KB

Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using Eines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one).

The 2-intersection number of paths and b
The 2-intersection number of paths and bounded-degree trees
✍ Michael S. Jacobson; AndrΓ© E. KΓ©zdy; Douglas B. West πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 416 KB πŸ‘ 1 views

## Abstract We represent a graph by assigning each vertex a finite set such that vertices are adjacent if and only if the corresponding sets have at least two common elements. The __2‐intersection number__ ΞΈ~2~(__G__) of a graph __G__ is the minimum size of the union of sets in such a representatio

Maximizing the number of independent sub
Maximizing the number of independent subsets over trees with bounded degree
✍ Clemens Heuberger; Stephan G Wagner πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 208 KB πŸ‘ 1 views

## Abstract The number of independent vertex subsets is a graph parameter that is, apart from its purely mathematical importance, of interest in mathematical chemistry. In particular, the problem of maximizing or minimizing the number of independent vertex subsets within a given class of graphs has