✦ LIBER ✦

Steiner Numbers in Graphs

✍ Scribed by Oellermann, Ortrud R.

Book ID: 118135912
Publisher: Taylor and Francis Group
Year: 1990
Tongue: English
Weight: 212 KB
Volume: 13
Category: Article
ISSN: 1607-3606
DOI: 10.1080/16073606.1990.9631609

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Steiner, geodetic and hull number

On the Steiner, geodetic and hull numbers of graphs

✍ Carmen Hernando; Tao Jiang; Mercè Mora; Ignacio M. Pelayo; Carlos Seara 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 295 KB

Steiner intervals in graphs

✍ Ewa Kubicka; Grzegorz Kubicki; Ortrud R. Oellermann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 664 KB

Let G be a graph and U, L' two vertices of G. Then the interval from K to 2' consists of all those vertices that lie on some shortest u -1; path. Let S be a set of vertices in a connected graph G. Then the Steiner distance d,(S) of S in G is the smallest number of edges in a connected subgraph of G

Steiner centers in graphs

✍ Ortrud R. Oellermann; Songlin Tian 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 515 KB

## Abstract The Steiner distance of a set __S__ of vertices in a connected graph __G__ is the minimum size among all connected subgraphs of __G__ containing __S.__ For __n__ ≥ 2, the __n__‐eccentricity __e~n~__(ν) of a vertex ν of a graph __G__ is the maximum Steiner distance among all sets __S__ o

EXTREME STEINER GRAPHS

✍ SANTHAKUMARAN, A. P. 📂 Article 📅 2012 🏛 World Scientific 🌐 English ⚖ 239 KB

The steiner problem in graphs

✍ S. E. Dreyfus; R. A. Wagner 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 567 KB

Thek-Steiner Ratio in Graphs

✍ Borchers, Al; Du, Ding-Zhu 📂 Article 📅 1997 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 293 KB