Abstract
We consider regular tessellations of the plane as infinite graphs in which edges and faces meet at each vertex, and in which edges and vertices surround each face. For , these are tilings of the Euclidean plane; for , they are tilings of the hyperbolic plane. We choose a vertex as the origin, and classify vertices into generations according to their distance (as measured by the number of edges in a shortest path) from the origin. For all and with , we determine the rational generating function giving the number of vertices in each generation.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.