✦ LIBER ✦

On the spectrum of an infinite graph

✍ Scribed by Vladimír Müller

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 144 KB
Volume: 93
Category: Article
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(87)90324-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The spectrum of an infinite graph

✍ Bojan Mohar 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 697 KB

Divisors and the spectrum of infinite gr

Divisors and the spectrum of infinite graphs

✍ Bojan Mohar; Matjaž Omladič 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 530 KB

The center of an infinite graph

✍ L. Boza; A. Diánez; A. Márquez 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 344 KB

In this note we extend the notion of the center of a graph to infinite graphs. Thus, a vertex is in the center of the infinite graph G if it is in the center of an increasing family of finite subgraphs covering G. We give different characterizations of when a vertex is in the center of an infinite g

On the notion of infinite Hamiltonian gr

On the notion of infinite Hamiltonian graph

✍ R. Halin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Based on the terms “end” and “cofinal spanning subtree” a general notion of Hamiltonicity of infinite graphs is developed. It is shown that the cube of every connected locally finite graph is Hamiltonian in this generalized sense.

On the girth of infinite graphs

✍ Norbert Seifter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 599 KB

Let X be an infinite k-valent graph with polynomial growth of degree d, i.e. there is an integer d and a constant c such that fx(n) 3, d> 1, 123, there exist k-valent connected graphs with polynomial growth of degree d and girth greater than 1. This means that in general the girth of graphs with pol

The bond and cycle spaces of an infinite

The bond and cycle spaces of an infinite graph

✍ Karel Casteels; R. Bruce Richter 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and Kühn introduced a different cycle space of infinite graphs based on allowing infinite circuits. A more general point of view w