✦ LIBER ✦

n-cubes and median graphs

✍ Scribed by Martyn Mulder

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 156 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040112

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

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

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

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

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__

The 2-hamiltonian cubes of graphs

✍ K. M. Koh; K. L. Teo 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Cube factorizations of complete graphs

✍ Peter Adams; Darryn Bryant; Barbara Maenhaut 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract A cube factorization of the complete graph on __n__ vertices, __K~n~__, is a 3‐factorization of __K~n~__ in which the components of each factor are cubes. We show that there exists a cube factorization of __K~n~__ if and only if __n__ ≡ 16 (mod 24), thus providing a new family of unifor