On the Complexity of the Classification of Synchronizing Graphs

DOI10.1007/978-3-642-17625-8_19zbMath1214.68261OpenAlexW1603360505MaRDI QIDQ5392727

Eduardo A. Canale, Pablo Monzón, Franco Robledo

Publication date: 14 April 2011

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17625-8_19

zbMATH Keywords

coupled oscillatorsnetwork synchronizationgraph complexitysynchronizing graphs

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Synchronization in complex networks of phase oscillators: a survey

Cites Work

• From Kuramoto to Crawford: Exploring the onset of synchronization in population of coupled oscillators
• On Exponential Synchronization of Kuramoto Oscillators
• Unnamed Item
• Unnamed Item
• Unnamed Item