𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cube intersection concepts in median graphs

✍ Scribed by Boštjan Brešar; Tadeja Kraner Šumenjak

Book ID
108114067
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
615 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

n-cubes and median graphs
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.

A fixed cube theorem for median graphs
A fixed cube theorem for median graphs
✍ Hans-Jürgen Bandelt; Marcel van de Vel 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 513 KB

The following result is proven: every edge-preserving self-map of a median graph leaves a cube invariant. This extends a fixed edge theorem for trees and parallels a result on invariant simplices in contractible graphs.

Roots of cube polynomials of median grap
Roots of cube polynomials of median graphs
✍ Boštjan Brešar; Sandi Klavžar; Riste Škrekovski 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract The cube polynomial __c__(__G__,__x__) of a graph __G__ is defined as $\sum\nolimits\_{i \ge 0} {\alpha \_i ( G)x^i }$, where α~i~(__G__) denotes the number of induced __i__‐cubes of __G__, in particular, α~0~(__G__) = |__V__(__G__)| and α~1~(__G__) = |__E__(__G__)|. Let __G__ be a medi

Medians in median graphs
Medians in median graphs
✍ H.J. Bandelt; J.P. Barthélemy 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 668 KB