Abstract
We prove that there are only finitely many symmetrical extensions of a locally finite tree by a finite graph. Moreover, we prove that there are only finitely many pairwise nonequivalent realizations of symmetrical extensions of a locally finite tree by a finite graph.
Similar content being viewed by others
References
V. I. Trofimov, “The finiteness of the number of symmetrical 2-extensions of the d-dimensional grid and similar graphs,” Tr. Inst. Mat. Mekh. 19 (3), 290–303 (2013).
V. I. Trofimov, “Symmetrical extensions of the graphs and some other topics in graph theory related with group theory,” Proc. Steklov Inst. Math. 279 (Suppl. 1), S107–S112 (2012).
E. A. Neganova and V. I. Trofimov, “Symmetrical extensions of graphs,” Izv. Math. 78 (4), 809–835 (2014).
V. I. Trofimov, “On symmetrical extensions of trees by finite graphs,” in Algebra and Linear Optimization: Abstracts of the International Conference Dedicated to S.N. Chernikov’s 100th Birthday, Yekaterinburg, Russia, 2012, p. 159.
V. I. Trofimov, “Some remarks on symmetrical extensions of graphs,” Tr. Inst. Mat. Mekh. 20 (2), 284–292 (2014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.I. Trofimov, 2015, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2015, Vol. 21, No. 3.
Rights and permissions
About this article
Cite this article
Trofimov, V.I. The finiteness of the number of symmetrical extensions of a locally finite tree by a finite graph. Proc. Steklov Inst. Math. 295 (Suppl 1), 168–173 (2016). https://doi.org/10.1134/S0081543816090170
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0081543816090170