𝔖 Bobbio Scriptorium
✦   LIBER   ✦

EXTREME STEINER GRAPHS

✍ Scribed by SANTHAKUMARAN, A. P.


Book ID
120038237
Publisher
World Scientific
Year
2012
Tongue
English
Weight
239 KB
Volume
04
Category
Article
ISSN
1793-8309

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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

Steiner distance stable graphs
✍ Wayne Goddard; Ortrud R. Oellermann; Henda C. Swart πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 673 KB

Let G be a connected graph and S a nonempty set of vertices of G. Then the Steiner distance d,(S) of S is the smallest number of edges in a connected subgraph of G that contains S. Let k, I, s and m be nonnegative integers with m > s > 2 and k and I not both 0. Then a connected graph G is said to be

Steiner Numbers in Graphs
✍ Oellermann, Ortrud R. πŸ“‚ Article πŸ“… 1990 πŸ› Taylor and Francis Group 🌐 English βš– 212 KB
Steiner Distance-Hereditary Graphs
✍ Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. πŸ“‚ Article πŸ“… 1994 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 760 KB