𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Steiner Distance-Hereditary Graphs

✍ Scribed by Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C.

Book ID
118198107
Publisher
Society for Industrial and Applied Mathematics
Year
1994
Tongue
English
Weight
760 KB
Volume
7
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A characterization of 3-Steiner distance
A characterization of 3-Steiner distance hereditary graphs
✍ Day, D. P.; Oellermann, Ortrud R.; Swart, Henda C. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 174 KB πŸ‘ 1 views

Let G be a connected graph and S βŠ† V (G). Then, the Steiner distance of S in G, denoted by d G (S), is the smallest number of edges in a connected subgraph of G that contains . Some general properties about the cycle structure of k-Steiner distance hereditary graphs are established. These are then

Weighted connected domination and Steine
Weighted connected domination and Steiner trees in distance-hereditary graphs
✍ Yeh Hong-Gwa; Gerard J. Chang πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 649 KB

Distance-hereditary graphs are graphs in which every two vertices have the same distance in every connected induced subgraph containing them. This paper studies distance-hereditary graphs from an algorithmic viewpoint. In particular, we present linear-time algorithms for finding a minimum weighted c

Steiner distance stable graphs
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