By Topic

Graph coloring via synchronization of coupled oscillators

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wu, C.W. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA

In this work, we study the possibility of coloring graphs by means of synchronized coupled oscillators. We consider an array of coupled oscillators as a graph by associating the oscillators to vertices and the coupling to edges. When the coupled array is synchronized, the phase of the oscillators can be considered as the color associated with the corresponding vertices. We prove that for connected 2-colorable graphs, we can construct a coupled array which generates the 2-coloring for that graph. For the general case, numerical simulation results with connected 3-colorable graphs suggest that the coupled array of oscillators can color graphs with a small number of colors in most cases. Some complexity issues of the system and comparisons to antivoter models of graph coloring are discussed. We also conjecture that the system can be used to approximate the star chromatic number of the graph

Published in:

Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on  (Volume:45 ,  Issue: 9 )