On the Complexity of the Classification of Synchronizing Graphs
This article deals with the general ideas of almost global synchronization of Kuramoto coupled oscillators and synchronizing graphs. It reviews the main existing results and gives some new results about the complexity of the problem. It is proved that any connected graph can be transformed into a sy...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | bookPart |
| Language: | English |
| Published: |
2010
|
| Online Access: | https://hdl.handle.net/20.500.12008/38705 |
| Tags: |
No Tags, Be the first to tag this record!
|