𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Finite graphs associated with a cut-and-project set

✍ Scribed by Nicolae Cotfas

Book ID
110364977
Publisher
Springer
Year
2001
Tongue
English
Weight
191 KB
Volume
51
Category
Article
ISSN
0011-4626

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs omitting a finite set of cycles
Graphs omitting a finite set of cycles
✍ Cherlin, Gregory; Shi, Niandong πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 300 KB πŸ‘ 2 views

We prove that for C a finite set of cycles, there is a universal C-free graph if and only if C consists precisely of all the odd cycles of order less than same specified bound.

Jacobian Tori Associated with a Finite G
Jacobian Tori Associated with a Finite Graph and Its Abelian Covering Graphs
✍ Motoko Kotani; Toshikazu Sunada πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 176 KB

We develop a graph-theoretic analogue of the Jacobian torus, which is defined, for a finite graph X, as the torus H 1 X R /H 1 X Z with a natural flat metric. It is observed that this notion, especially the volume of Jacobian tori, appears in many contexts of graph theory.