Undirected and directed graphs with near polynomial growth
Discussiones Mathematicae. Graph Theory, Tome 23 (2003) no. 2, pp. 383-391
Voir la notice de l'article provenant de la source Library of Science
The growth function of a graph with respect to a vertex is near polynomial if there exists a polynomial bounding it above for infinitely many positive integers. In the paper vertex-symmetric undirected graphs and vertex-symmetric directed graphs with coinciding in- and out-degrees are described in the case their growth functions are near polynomial.
Keywords:
vertex-symmetric graph, vertex-symmetric directed graph, near polynomial growth, multivalued mapping
@article{DMGT_2003_23_2_a11,
author = {Trofimov, V.},
title = {Undirected and directed graphs with near polynomial growth},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {383--391},
publisher = {mathdoc},
volume = {23},
number = {2},
year = {2003},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2003_23_2_a11/}
}
Trofimov, V. Undirected and directed graphs with near polynomial growth. Discussiones Mathematicae. Graph Theory, Tome 23 (2003) no. 2, pp. 383-391. http://geodesic.mathdoc.fr/item/DMGT_2003_23_2_a11/