Ends of graphs

Rögnvaldur G. Möller

doi:10.1017/S0305004100075344

Ends of graphs

Rögnvaldur G. Möller^*

^*Corresponding author for this work

Faculty of Physical Sciences

Research output: Contribution to journal › Article › peer-review

27 Citations (Scopus)

Abstract

It is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.

Original language	English
Pages (from-to)	255-266
Number of pages	12
Journal	Mathematical Proceedings of the Cambridge Philosophical Society
Volume	111
Issue number	2
DOIs	https://doi.org/10.1017/S0305004100075344
Publication status	Published - Mar 1992

Access to Document

10.1017/S0305004100075344

Cite this

@article{5ac96d9c57bd419492d19507414302b4,

title = "Ends of graphs",

abstract = "It is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.",

author = "M{\"o}ller, {R{\"o}gnvaldur G.}",

year = "1992",

month = mar,

doi = "10.1017/S0305004100075344",

language = "English",

volume = "111",

pages = "255--266",

journal = "Mathematical Proceedings of the Cambridge Philosophical Society",

issn = "0305-0041",

publisher = "Cambridge University Press",

number = "2",

}

TY - JOUR

T1 - Ends of graphs

AU - Möller, Rögnvaldur G.

PY - 1992/3

Y1 - 1992/3

N2 - It is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.

AB - It is shown how questions about ends of locally finite graphs can be reduced to questions about trees. Several applications are given; for example, locally finite connected graphs with infinitely many ends and automorphism groups that act transitively on the ends are classified.

UR - http://www.scopus.com/inward/record.url?scp=84971145713&partnerID=8YFLogxK

U2 - 10.1017/S0305004100075344

DO - 10.1017/S0305004100075344

M3 - Article

AN - SCOPUS:84971145713

SN - 0305-0041

VL - 111

SP - 255

EP - 266

JO - Mathematical Proceedings of the Cambridge Philosophical Society

JF - Mathematical Proceedings of the Cambridge Philosophical Society

IS - 2

ER -

Ends of graphs

Abstract

Access to Document

Fingerprint

Cite this