✦ LIBER ✦

The spectrum of an infinite graph

✍ Scribed by Bojan Mohar

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 697 KB
Volume: 48
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90111-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An infinite family of integral graphs

✍ Moshe Roitman 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 272 KB

We obtain here an infinite family of integral complete tripartite grapbs. The 'purpose-of this note is to obtain an infinite family of integral mmpjete tripartite graphs. For background see [l]. We recall first some detitions and facts. A complete n-pu\*te gnzph K(p\*, l . l 5 p,,) is a graph with a

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

An accessibility theorem for infinite gr

An accessibility theorem for infinite graph minors

✍ Reinhard Diestel 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 67 KB

An infinite family of biprimitive semisy

An infinite family of biprimitive semisymmetric graphs

✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti