Divisors and the spectrum of infinite graphs
✍ Scribed by Bojan Mohar; Matjaž Omladič
- Publisher
- Elsevier Science
- Year
- 1987
- Tongue
- English
- Weight
- 530 KB
- Volume
- 91
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For each commutative ring R we associate a simple graph ⌫ R . We investigate the interplay between the ring-theoretic properties of R and the graph-theo-Ž . retic properties of ⌫ R .
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
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
## Abstract The fractional chromatic number of a graph __G__ is the infimum of the total weight that can be assigned to the independent sets of __G__ in such a way that, for each vertex __v__ of __G__, the sum of the weights of the independent sets containing __v__ is at least 1. In this note we g