𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Median problems on wheels and cactus graphs

✍ Scribed by J. Hatzl

Publisher
Springer Vienna
Year
2007
Tongue
English
Weight
168 KB
Volume
80
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The obnoxious center problem on weighted
The obnoxious center problem on weighted cactus graphs
✍ BlaΕΎ Zmazek; Janez Ε½erovnik πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 264 KB

The obnoxious center problem in a graph G asks for a location on an edge of the graph such that the minimum weighted distance from this point to a vertex of the graph is as large as possible. An algorithm is given which ΓΏnds the obnoxious center on a weighted cactus graph in O(cn) time, where n is t

On compact median graphs
On compact median graphs
✍ Tardif, Claude πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 715 KB

A median graph is called compact if it does not contain an isometric ray. This property is shown to be equivalent to the finite intersection property for convex sets. We show that a compact median graph contains a finite cube that is fixed by all of its automorphisms, and that each family of commuti

On graphs with prescribed median I
On graphs with prescribed median I
✍ G. R. T. Hendry πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 202 KB πŸ‘ 1 views

The distance of a vertex u in a connected graph H is the sum of all the distances from u to the other vertices of H. The median M(H) of H is the subgraph of H induced by the vertices of minimum distance. For any graph G, let f ( G ) denote the minimum order of a connected graph H satisfying M(H) = G

Locating median paths on connected outer
Locating median paths on connected outerplanar graphs
✍ Isabella Lari; Federica Ricca; Andrea Scozzari; Ronald I. Becker πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 215 KB πŸ‘ 1 views