On exponential trees (Q1378292): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:23, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On exponential trees |
scientific article |
Statements
On exponential trees (English)
0 references
13 October 1998
0 references
The paper considers locally finite graphs \(G=(V,E)\). \(G\) is called exponential if \(| G^d(X) |>2 \cdot | X|\) holds for an integer \(d\) and for every finite subset \(X\) of \(V\), where \(G^d(X)\) is the set of all vertices of \(G\) whose distance to a vertex in \(X\) is at most \(d\). The paper gives a characterization of exponentiality for a large class of trees.
0 references
exponential trees
0 references
characterization of exponentiality
0 references