Pasar al contenido principal

From weighted to unweighted graphs in Synchronizing Graph Theory.

Tipo
Artículo de journal
Año
2022
Abstract

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 , where  means vertices  and  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 that ensures synchronization is found.

Autores