\(\omega\)-periodic graphs (Q2571289): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Christopher Hoffmann / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Gabriel Semanisin / rank
Normal rank
 
Property / author
 
Property / author: Christopher Hoffmann / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Gabriel Semanisin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0308092 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:11, 19 April 2024

scientific article
Language Label Description Also known as
English
\(\omega\)-periodic graphs
scientific article

    Statements

    \(\omega\)-periodic graphs (English)
    0 references
    0 references
    0 references
    1 November 2005
    0 references
    A graph \(G\) with vertices labeled by integers is called \(\omega\)-periodic if it is a union of periodic graphs over the set of integers. It is shown that \(\omega\)-periodic graphs are amenable and the possible volume growth of \(\omega\)-periodic graphs is presented. Moreover it is shown that there are \(\omega\)-periodic graphs of (non-linear) polynomial growth as well as ones with exponential volume growth.
    0 references
    volume growth
    0 references

    Identifiers