✦ LIBER ✦

On compact median graphs

✍ Scribed by Tardif, Claude

Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 715 KB
Volume: 23
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199612)23:4<325::aid-jgt1>3.0.co;2-t

No coin nor oath required. For personal study only.

✦ Synopsis

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 commuting endomorphisms of a compact median graph fixes a common cube.

📜 SIMILAR VOLUMES

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

Medians of arbitrary graphs

✍ Peter J. Slater 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

## Abstract For each vertex __u__ in a connected graph __H__, the __distance__ of __u__ is the sum of the distances from __u__ to each of the vertices __v__ of __H.__ A vertex of minimum distance in __H__ is called a __median__ vertex. It is shown that for any graph __G__ there exists a graph __H__

On Steiner centers and Steiner medians o

On Steiner centers and Steiner medians of graphs

✍ Oellermann, Ortrud R. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 143 KB

Let G be connected graph and S a set of vertices of G. Then a Steiner tree for S is a connected subgraph of G of smallest size (number of edges) that contains S. The size of such a subgraph is called the Steiner distance for S and is denoted by d(S). For a vertex v of G, and integer n, 2 Յ n Յ ͉V(G)

n-cubes and median graphs

✍ Martyn Mulder 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract The n‐cube is characterized as a connected regular graph in which for any three vertices __u, v__, and __w__ there is a unique vertex that lies simultaneously on a shortest (__u, v__)‐path, a shortest (__v, w__)‐path, and a shortest (__w, u__)‐path.

Infinite median graphs, (0, 2)-graphs, a

Infinite median graphs, (0, 2)-graphs, and hypercubes

✍ Hans-J. Bandelt; Henry Martyn Mulder 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Hypercubes are characterized among connected bipartite graphs by interval conditions in several ways. These results are based on the following two facts: (i) connected bipartite graphs are median provided that all their intervals induce median graphs, and (ii) median (0, 2)graphs are hypercubes. No