From weighted to unweighted graphs in Synchronizing Graph Theory

Publication date 13 September 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

d o t h e t a_{i} = s u m_{j s i m i} s i n (h e t a_{j} - h e t a_{j})

, where

i s i m 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.

This page was built for publication: From weighted to unweighted graphs in Synchronizing Graph Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6410674)