Abstract
Abstract To each colored graph one can associate its closure in the universal space of isomorphism classes of pointed colored graphs, and this subspace can be regarded as a generalized subshift. Based on this correspondence, we introduce two definitions for chaotic (colored) graphs, one of them analogous to Devaney’s. We show the equivalence of our two novel definitions of chaos, proving their topological genericity in various subsets of the universal space.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
