A description of algebras of linear growth is given. This leads to a new invariant which is similar to the number of ends of a group. This note is a further step in developing of a geometric study of infinite algebras and C\*-algebras which should lead to a common geometric framework for infinite di
Independent Sets and Free Preprimal Algebras
β Scribed by Klaus Denecke
- Publisher
- John Wiley and Sons
- Year
- 1982
- Tongue
- English
- Weight
- 275 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An independent set S of a graph G is said to be essential if S has a pair of vertices distance t w o apart in G. We prove that if every essential independent set S of order k 2 2 in a k-connected graph of order p satisfies max{deg u : u E S} I p, then G is hamiltonian. This generalizes the result of
## Abstract A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no __r__βregular uniquely hamiltonian graphs when __r__β>β22. This improves upon earlier results of Thomassen. Β© 2006 Wiley Periodicals, Inc. J Graph Theory 54: 233β244, 20