Graphs with polynomial growth are covering graphs

C. Godsil; Norbert Seifter

doi:10.1007/BF02349960

Graphs with polynomial growth are covering graphs

C. Godsil
, Norbert Seifter

Chair of Applied Mathematics (170)

University of Waterloo

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

4 Citations (Scopus)

Abstract

LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.

Original language	English
Pages (from-to)	233-241
Number of pages	9
Journal	Graphs and combinatorics
Volume	8.1992
Issue number	September
DOIs	https://doi.org/10.1007/BF02349960
Publication status	Published - Sept 1992

Access to Document

10.1007/BF02349960

Cite this

@article{8890cce3c1a344adb9f6ff4f34ddb926,

title = "Graphs with polynomial growth are covering graphs",

abstract = "LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.",

author = "C. Godsil and Norbert Seifter",

year = "1992",

month = sep,

doi = "10.1007/BF02349960",

language = "English",

volume = "8.1992",

pages = "233--241",

journal = "Graphs and combinatorics ",

publisher = "Springer Japan",

number = "September",

}

TY - JOUR

T1 - Graphs with polynomial growth are covering graphs

AU - Godsil, C.

AU - Seifter, Norbert

PY - 1992/9

Y1 - 1992/9

N2 - LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.

AB - LetX be a connected locally finite transitive graph with polynomial growth. We show that there exist infinitely many finite graphsY 1,Y 2,... such thatX is a covering graph of each of these graphs and everyY k ,k≥2, is covering graph of the graphsY 1,...,Y k-1 . IfX is in additions-transitive for somes≥2 the graphsY i can be assumed to be at leasts-transitive.

UR - https://doi.org/10.1007/BF02349960

U2 - 10.1007/BF02349960

DO - 10.1007/BF02349960

M3 - Article

VL - 8.1992

SP - 233

EP - 241

JO - Graphs and combinatorics

JF - Graphs and combinatorics

IS - September

ER -

Graphs with polynomial growth are covering graphs

Abstract

Access to Document

Other files and links

Cite this