✦ LIBER ✦

Medians in median graphs

✍ Scribed by H.J. Bandelt; J.P. Barthélemy

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 668 KB
Volume: 8
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90096-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local medians in chordal graphs

✍ Heiko Wittenberg 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 535 KB

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 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

Regular pseudo-median graphs

✍ Hans-Jürgen Bandelt; Henry Martyn Mulder 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

A graph is pseudo-median if for every triple u, v, w of vertices there exists either a unique vertex between each pair of them (if their mutual distances sum up to an even number) or a unique triangle whose edges lie between the three pairs of u, v, w, respectively (if the distance sum is odd). We s

Recognizing median graphs in subquadrati

Recognizing median graphs in subquadratic time

✍ Johann Hagauer; Wilfried Imrich; Sandi Klavžar 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 1018 KB

Invariant Hamming graphs in infinite qua

Invariant Hamming graphs in infinite quasi-median graphs

✍ Marc Chastand; Norbert Polat 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 593 KB

It is shown that a quasi-median graph G without isometric infinite paths contains a Hamming graph (i.e., a cartesian product of complete graphs) which is invariant under any automorphism of G, and moreover if G has no infinite path, then any contraction of G into itself stabilizes a finite Hamming g