Abstract
AbstractNon‐isomorphic coupled cell networks with the same number of cells and with equivalent dynamics are said to be ODE‐equivalent. Moreover, they are all related by a linear algebra condition involving their graph adjacency matrices. A network in an ODE‐class is said to be minimal if it has a minimum number of edges among all the networks of the class. In this short paper we review the characterization of the minimal networks of an ODE‐equivalence class and we present an example for the case of non‐homogeneous networks. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
