✦ LIBER ✦

Bounding the expected number of rectilinear full Steiner trees

✍ Scribed by Christian Wulff-Nilsen

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 266 KB
Volume: 56
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20342

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The largest minimal rectilinear steiner

The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter

✍ F. R. K. Chung; F. K. Hwang 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 444 KB 👁 2 views

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

A Note on the m-Bounded Chromatic Number

A Note on the m-Bounded Chromatic Number of a Tree

✍ Bor-Liang Chen; Ko-Wei Lih 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 77 KB

The \(m\)-bounded chromatic number of a graph \(G\) is the smallest number of colors required for a proper coloring of \(G\) in which each color is used at most \(m\) times. We will establish an exact formula for the \(m\)-bounded chromatic number of a tree.

A lower bound on the number of spanning

A lower bound on the number of spanning trees with k end-vertices

✍ Katherine Heinrich; Guizhen Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB 👁 1 views

If a graph G with cycle rank p contains both spanning trees with rn and with n end-vertices, rn < n, then G has at least 2p spanning trees with k end-vertices for each integer k, rn < k < n. Moreover, the lower bound of 2p is best possible. [ l ] and Schuster [4] independently proved that such span