Summary
This proposal focuses on two related families of problems concerning algebraic invariants of
graphs, i.e., networks. On the one hand, we study extremal values of algebraic invariants, i. e.,
we propose to give lower and upper bounds for certain algebraic graph parameters in a given
class of graphs like d{regular graphs. On the other hand, we study the behavior of algebraic
invariants of very large graphs, more precisely we study whether for a certain graph parameter
p(G) it is true that the sequence (p(G_n)) converges if the graph sequence (G_n)
converges in some sense. The two families of problems are connected by the observation that many graph
parameter does not achieve its extremal value on finite graphs, but on some infinite object which
is the limit of finite graphs.
graphs, i.e., networks. On the one hand, we study extremal values of algebraic invariants, i. e.,
we propose to give lower and upper bounds for certain algebraic graph parameters in a given
class of graphs like d{regular graphs. On the other hand, we study the behavior of algebraic
invariants of very large graphs, more precisely we study whether for a certain graph parameter
p(G) it is true that the sequence (p(G_n)) converges if the graph sequence (G_n)
converges in some sense. The two families of problems are connected by the observation that many graph
parameter does not achieve its extremal value on finite graphs, but on some infinite object which
is the limit of finite graphs.
Unfold all
/
Fold all
More information & hyperlinks
| Web resources: | https://cordis.europa.eu/project/id/747430 |
| Start date: | 01-09-2017 |
| End date: | 31-08-2019 |
| Total budget - Public funding: | 134 239,20 Euro - 134 239,00 Euro |
Cordis data
Original description
This proposal focuses on two related families of problems concerning algebraic invariants ofgraphs, i.e., networks. On the one hand, we study extremal values of algebraic invariants, i. e.,
we propose to give lower and upper bounds for certain algebraic graph parameters in a given
class of graphs like d{regular graphs. On the other hand, we study the behavior of algebraic
invariants of very large graphs, more precisely we study whether for a certain graph parameter
p(G) it is true that the sequence (p(G_n)) converges if the graph sequence (G_n)
converges in some sense. The two families of problems are connected by the observation that many graph
parameter does not achieve its extremal value on finite graphs, but on some infinite object which
is the limit of finite graphs.
Status
CLOSEDCall topic
MSCA-IF-2016Update Date
28-04-2024
Images
No images available.
Geographical location(s)
