Trees on hyperbolic honeycombs
classification
🧮 math.CO
keywords
treeshyperboliclatticearticleconsideringconstructededgesexamine
read the original abstract
In the hyperbolic plane there are infinite regular lattices. From a fix vertex of a lattice tree graphs can be constructed recursively to the next layers with edges of the lattice. In this article we examine the properties of the growing of trees and the probabilities of length of trees considering the vertices on level i.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.