FOLDING OF SOME TYPES OF CHAOTIC GRAPHS

Abstract

There are many physical systems whose structures can be displayed by drawing a diagram consisting of points called "vertices" and line segments called "edges" which connect these vertices so that such vertices and edges indicate components and relationships between these components. Such a diagram is called "Linear graph" whose name depends on the kind of the physical system we deal with. The branch of Mathematics concerning this study is called "Graph Theory" which has established itself as an important mathematical tool in a wide variety of subjects, ranging from operational research and linguistics to chemistry and genetics; at the same time it has also emerged as a worthwhile mathematical discipline in its own right.

As the title of this thesis suggests, we are concerned with the study of a special type of graphs that is called "chaotic graph", which applied in many uncertain circuits, resonance, perturbation theory... and many other applications. Also, more advanced applications using the more complicated graphs are the chaotic graphs.