Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-16T17:08:40.727Z Has data issue: false hasContentIssue false
  • English
  • Français

Ends of graphs. II

Published online by Cambridge University Press:  24 October 2008

Rögnvaldur G. Möllert
Rögnvaldur G. Möllert
Affiliation:
Mathematical Institute, 24–29 St Giles', Oxford 0X1 3LB
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper deals with locally finite connected graphs with infinitely many ends. The structure of such graphs with a transitive group of automorphisms that fixes an end is investigated.

Type
Research Article
Information
Mathematical Proceedings of the Cambridge Philosophical Society , Volume 111 , Issue 3 , May 1992 , pp. 455 - 460
Copyright
Copyright © Cambridge Philosophical Society 1992

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Jung, H. A.. A note on fragments of infinite graphs. Combinatorica 1 (1981), 285–288.CrossRefGoogle Scholar
[2]Möller, R. G.. Ends of graphs. Math. Proc. Cambridge Philos. Soc. 111 (1992), 255–266.CrossRefGoogle Scholar
[3]Picardello, M. A. and Woess, W.. Harmonic functions and ends of graphs. Proc. Edinburgh Math. Soc. (2) 31 (1988), 457–461.CrossRefGoogle Scholar
[4]Soardi, P. M. and Woess, W.. Amenability, unimodularity, and the spectral radius of random walks on infinite graphs. Math. Z. 205 (1990), 471–486.CrossRefGoogle Scholar
[5]Watkins, M. E.. Infinite paths that contain only shortest paths. J. Combin. Theory Ser. B 41 (1986), 341–355.CrossRefGoogle Scholar
[6]Woess, W.. Amenable group actions on infinite graphs. Math. Ann. 284 (1989), 251–265.CrossRefGoogle Scholar
[7]Woess, W.. Boundaries of random walks on graphs and groups with infinitely many ends. Israel J. Math. 68 (1989), 271–301.Google Scholar
[8]Woess, W.. Topological groups and infinite graphs. Ann. Discrete Math. 95 (1991), 373–384.CrossRefGoogle Scholar