Abstract

We study the basic relation between skew-symmetric Lotka–Volterra (LV) systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric LV systems in terms of graphs as well as in terms of irreducible weighted graphs. We also obtain a description of their automorphism groups and of the relations which exist between these groups. The central notion introduced and used is that of decloning of graphs and of LV systems. We also give a functorial interpretation of the results which we obtain.

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 call

Disclaimer: 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.