Por favor, use este identificador para citar o enlazar este ítem: https://hdl.handle.net/20.500.12008/38706

Título:

The Wheels: an Infinite Family of Bi-connected Planar Synchronizing Graphs

Otros títulos:

Coordinador:

Director:

Compilador:

Autor:

Canale, Eduardo
Monzón, Pablo
Robledo, Franco

Tutor:

Tipo de documento:

Ponencia

Editor:

Palabras clave:

Descriptores:

Año de publicación:

2010

Contenido:

Resumen:

Almost global synchronization property of Kuramoto coupled oscillations was recently introduced and stands for the case where almost every initial condition of the dynamical system leads to the synchronization of all the agents. When the oscillators are all identical, the property only depends on the the underlying interconnection graph. If the property is present, the interconnection graph is called synchronizing. It is known that a graph is synchronizing if and only if its block are. So, the characterization of synchronizing graphs can be restricted to the class of bi-connected graphs. In this work, we present the first known infinite family of biconnected planar synchronizing graphs, named, the wheels. Besides, we present two graph which are the first known chordal graph and Halin graphs that not synchronize.

Descripción:

metadata.articulos.dc.description.uri:

Editorial:

IEEE

EN:

5th IEEE Conference on Industrial Electronics and Applications, Taichung, Taiwan, 2010.

Financiadores:

Citación:

Canale, E, Monzón, P, Robledo, F. “The Wheels: an Infinite Family of Bi-connected Planar Synchronizing Graphs”. Proceedings of the 5th IEEE Conference on Industrial Electronics and Applications, Taichung, Taiwan, 2010..

Citación:

metadata.articulos.cc.license.name:

ISBN:

e-ISBN:

ISSN:

ISMN:

Otros identificadores:

Cobertura geográfica:

Cobertura temporal:

Departamento académico:

Grupo de investigación:

Licencia:

Licencia Creative Commons Atribución - No Comercial - Sin Derivadas (CC - By-NC-ND 4.0)
FicherosDescripciónTamañoFormato
Este ítem no contiene archivos