Por favor, use este identificador para citar o enlazar este ítem:
https://hdl.handle.net/20.500.12008/50526
Cómo citar
| Título: | From weighted to unweighted graphs in Synchronizing Graph Theory. |
| Autor: | Canale, Eduardo A. |
| Tipo: | Preprint |
| Palabras clave: | Combinatorics, Dynamical Systems, Optimization and Control |
| Fecha de publicación: | 2022 |
| Resumen: | A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system θ˙i=∑j∼isin(θj−θj), where i∼j means vertices i and j are adjacent in the corresponding graph. As a consequence, the existence of linearly stable equilibrium is proved to be NP-Hard as conjectured by R. Taylor in 2015 and a new lower bound for the minimum degree that ensures synchronization is found. |
| Citación: | Canale, E. From weighted to unweighted graphs in Synchronizing Graph Theory [Preprint]. Publicado en: arXiv, oct. 2022, pp. 1-20. DOI: 10.48550/arXiv.2209.06362. |
| Licencia: | Licencia Creative Commons Atribución (CC - By 4.0) |
| Aparece en las colecciones: | Publicaciones académicas y científicas - IMERL (Instituto de Matemática y Estadística Rafael Laguardia) |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | ||
|---|---|---|---|---|---|
| Can22.pdf | Preprint | 119,81 kB | Adobe PDF | Visualizar/Abrir |
Este ítem está sujeto a una licencia Creative Commons Licencia Creative Commons
