## Abstract

Our aim in the present chapter is to introduce a new type of operations on the chaotic graph, namely, chaotic connected edge graphs under the identification topology. The concept of chaotic foldings on the chaotic edge graph will be discussed from the viewpoint of algebra and geometry. The relation between the chaotic homeomorphisms and chaotic foldings on the chaotic connected edge graphs and their fundamental group is deduced. The fundamental group of the limit chaotic chain of foldings on chaotic. Many types of chaotic foldings are achieved. Theorems governing these relations are achieved. We also discuss some applications in chemistry and biology.

### Keywords

- chaotic graph
- edge graph
- chaotic folding
- limit folding fundamental group
- 2010 Mathematics Subject Classification: 51H20
- 57N10
- 57M05
- 14F35
- 20F34

## 1. Introduction and definitions

During the past few decades, examinations of social, biological, and communication networks have taken on enhanced attention throughout these examinations; graphical representations of those networks and systems have been evident to be terribly helpful. Such representations are accustomed to confirm or demonstrate the interconnections or relationships between parts of those networks [1, 2].

A graph is an ordered G = (V(G), E(G)) where V(G) ≠ φ, E(G) is a set disjoint from V(G), elements of V(G) are called the vertices of G, and elements of E(G) are called the edges. The foundation stone of graph theory was laid by Euler in 1736 by solving a puzzle called Königsberg seven-bridge problem as in Figure 1 [1, 3].

There are many graphs with which one can construct a new graph from a given graph or set of graphs, such as the Cartesian product and the line graph. A graph G is a finite non-empty set V of objects called vertices (the singular is vertex) together with a set E of two-element subsets of V called edges. The number of vertices in a graph G is the order of G, and the number of edges is the size of G. To indicate that a graph G has vertex set V and edge set E, we sometimes write G = (V, E). To emphasize that V is the vertex set of a graph G, we often write V as V(G). For the same reason, we also write E as E(G). A graph H is said to be a subgraph of a graph G if V(H) ⊆ V(G) and E(H) ⊆ E(G). The complete graph with n-vertices will be denoted by _{n} [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]. Let G and H be two graphs. A function

The folding is a continuous function _{t}(s) is continuous [15]. Given spaces X and Y with chosen points _{0} and y_{0} to a single point [15]. Two spaces X and Y are of the “same homotopy type” if there exist continuous maps

## 2. The main results

First, we will introduce the following:

**Definition 1.***The chaotic edge**is a geometric edge**that carries many other edges**, each one of them homotopic to the original one as in*Figure 2*. Also the chaotic vertices of**are**and**. For chaotic edge**, we have two cases*:

**Case 1** (1) *are of the same physical properties*.

**Case 2** (2) *represent different physical properties; for example,**represents density,**represents hardness,**represents magnetic fields, and so on*.

**Definition 2.***A chaotic graph**is a collection of finite non-empty set**of objects called chaotic vertices together with a set**of two-element subsets of**called chaotic edges. The number of chaotic edges is the size of*

**Definition 3.***Given chaotic connected graphs**and**with given edges**and**, then the chaotic connected edge graph**⊻**is the quotient of disjoint union**acquired by identifying two chaotic edges**and**to a single chaotic edge (up to chaotic isomorphism) as in*Figure 3.

**Definition 4.***A chaotic graph**is called a chaotic subgraph of a chaotic graph**if**and*

**Definition 5.***Let**and**be two chaotic graphs. A function**is chaotic homomorphism from**to**if it preserves chaotic edges, that is, if for any chaotic edge**of**,**is a chaotic edge of*

**Definition 6.***A chaotic folding of a graph**is a chaotic subgraph**of**such that there exists a chaotic homomorphism**called chaotic folding with**for every chaotic vertex**of*

**Definition 7.***A chaotic core is a chaotic graph which does not chaotic retract to chaotic proper subgraph*.

**Theorem 1.***Let**and**be two chaotic connected graphs. Then*

**Proof.** Let

**Theorem 2.***The chaotic graphs**and**are chaotic subgraphs of**. Also, for any chaotic tree**and**is also chaotic tree and*

**Proof.** The proof of this theorem is clear.

**Theorem 3.***If**are connected graphs, and**is a sequence of chaotic topological foldings of**into itself, then there is an induced sequence**of non-trivial chaotic topological folding**such that**reduces the rank of*

**Proof.** Consider the following sequence of topological foldings

Since

**Theorem 4.***Let**and**be two chaotic graphs; then there is a chaotic homomorphism**which induces**if**is a chaotic folding of*

**Proof.** Let

**Theorem 5.***For any chaotic path graphs**there is a sequence of topological foldings with variation curvature**on**which induce a sequence of topological foldings**such that**and*

**Proof.** Consider the following sequence of chaotic topological foldings with variation curvature,

**Theorem 6.***For every two chaotic connected graphs**and**, the fundamental group of the limit of chaotic topological folding of*

**Proof.** Let

**Case (1)**: If

**Case (2)**: If

**Theorem 7.***If**and**are chaotic connected and not chaotic cores graphs, then**=*

**Proof.** If

## 3. Some applications

A polymer is composed of many repeating units called monomers. Starch, cellulose, and proteins are natural polymers. Nylon and polyethylene are synthetic polymers. Polymerization is the process of joining monomers. Polymers may be formed by addition polymerization; furthermore, one essential advance likewise polymerization is mix as in Figure 4, which happens when the polymer’s development is halted by free electrons from two developing chains that join and frame a solitary chain. The accompanying chart portrays mix, with the image (R) speaking to whatever remains of the chain.

Chemical nature of enzymes, all known catalysts are proteins. They are high atomic weight mixes made up primarily of chains of amino acids connected together by peptide bonds as in Figure 5.

There are two types of the subunit structure of ribosomes as in Figure 6 which is represented by the different connected types of protein subunit and rRNA to form a new type of ribosomes.

## 4. Conclusion

In this chapter, the fundamental group of the limit chaotic foldings on chaotic connected edge graphs is deduced. Also, we can deduce some algorithms from a new operation of a graph by using the adjacency matrices.