✦ LIBER ✦

Hamiltonian Properties of Grid Graphs

✍ Scribed by Zamfirescu, Christina; Zamfirescu, Tudor

Book ID: 118198461
Publisher: Society for Industrial and Applied Mathematics
Year: 1992
Tongue: English
Weight: 752 KB
Volume: 5
Category: Article
ISSN: 0895-4801
DOI: 10.1137/0405046

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonian properties of Toeplitz graph

Hamiltonian properties of Toeplitz graphs

✍ René van Dal; Gert Tijssen; Zsolt Tuza; Jack A.A. van der Veen; Christina Zamfir 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 524 KB

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.

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.

Metamaterial inclusions based on grid-gr

Metamaterial inclusions based on grid-graph Hamiltonian paths

✍ Vincenzo Pierro; John McVay; Vincenzo Galdi; Ahmad Hoorfar; Nader Engheta; Innoc 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract This article deals with a study of novel classes of metamaterial inclusions based on space‐filling curves. The graph–theoretic Hamiltonian‐path (HP) concept is exploited to construct a fairly broad class of space‐filling curve geometries that include as special cases the well‐known Hilb

Forbidden subgraphs and Hamiltonian prop

Forbidden subgraphs and Hamiltonian properties of graphs

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 344 KB

A Matrix Method for Counting Hamiltonian

A Matrix Method for Counting Hamiltonian Cycles on Grid Graphs

✍ Y.H.Harris Kwong; D.G. Rogers 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 154 KB

A matrix method is used to determine the number of Hamiltonian cycles on \(P_{m} \times P_{n}, m=4\), 5. This provides an alternative to other approaches which had been used to solve the problem. The method and its more generalized version, transfer-matrix method, may give easier solutions to cases

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