𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fibonacci (, )-cubes which are median graphs

✍ Scribed by Lifeng Ou; Heping Zhang

Book ID
119225075
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
226 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graphs which are locally a cube
Graphs which are locally a cube
✍ Dominique Buset 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 590 KB

We prove that there are exactly two connected graphs which are locally a cube: a graph on :I5 vertices which is the complement of the (3 x 5)-grid and a graph on 24 vertices which is the l-skeleton of a certain 4-dimensional regular polytope called the 24-cell.

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.

Generalized fibonacci cubes are mostly h
Generalized fibonacci cubes are mostly hamiltonian
✍ Jenshiuh Liu; Wen-Jing Hsu; Moon Jung Chung 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

## Abstract The __Hamiltonian problem__ is to determine whether a graph contains a spanning (Hamiltonian) path or cycle. Here we study the Hamiltonian problem for the __generalized Fibonacci cubes__, which are a new family of graphs that have applications in interconnection topologies [J. Liuand W.

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