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 boun...
ver más
¿Tienes un proyecto y buscas un partner? Gracias a nuestro motor inteligente podemos recomendarte los mejores socios y ponerte en contacto con ellos. Te lo explicamos en este video
Información proyecto ExtSpGraphLim
Duración del proyecto: 29 meses
Fecha Inicio: 2017-03-21
Fecha Fin: 2019-08-31
Fecha límite de participación
Sin fecha límite de participación.
Descripción del proyecto
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.