Name
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. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/BF02349960 | Graphs and Combinatorics |
Keywords | Field | DocType |
Polynomial Growth, Transitive Graph | Topology,Discrete mathematics,Block graph,Combinatorics,Comparability graph,Line graph,Forbidden graph characterization,Symmetric graph,1-planar graph,Universal graph,Covering graph,Mathematics | Journal |
Volume | Issue | ISSN |
8 | 3 | 1435-5914 |
Citations | PageRank | References |
3 | 1.00 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. D. Godsil | 1 | 428 | 81.12 |
| N Seifter | 2 | 137 | 26.49 |