𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Hamiltonian properties of Toeplitz graphs

✍ Scribed by René van Dal; Gert Tijssen; Zsolt Tuza; Jack A.A. van der Veen; Christina Zamfirescu; Tudor Zamfirescu

Book ID
103061437
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
524 KB
Volume
159
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Conditions are given for the existence of hamiltonian paths and cycles in the so-called Toeplitz graphs, i.e. simple graphs with a symmetric Toeplitz adjacency matrix.

📜 SIMILAR VOLUMES

Hamiltonian Properties of Grid Graphs
Hamiltonian Properties of Grid Graphs
✍ Zamfirescu, Christina; Zamfirescu, Tudor 📂 Article 📅 1992 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 752 KB
Hamiltonian properties of domination-cri
Hamiltonian properties of domination-critical graphs
✍ Ewa Wojcicka 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 445 KB

## Abstract In this paper we show that every connected, 3‐γ‐critical graph on more than 6 vertices has a Hamiltonian path.

On edge-Hamiltonian property of Cayley g
On edge-Hamiltonian property of Cayley graphs
✍ C.C. Chen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Let G be a group generated by X. A Cayley graph ouer G is defined as a graph G(X) whose vertex set is G and whose edge set consists of all unordered pairs [a, b] with a, b E G and am'b E X U X-', where X-t denotes the set (x-t ( .x E X}. When X is a minimal generating set or each element of X is of