In this paper we will introduce new type of chaotic graphs, when vertices of these graphs are appearance like line and edges of these graphs are appearance like tape or ribbon and when these graphs carries physical characters . The representation of the chaotic graphs by matrices will be obtained. The transformations of the chaotic graph into itself and into another graphs will be discussed.Keywords: Chaotic, Graphs
Definitions and background
Abstract graphs:An abstract graphs G is a diagram consisting of a finite non empty set of the elements, called "vertices" denoted by V(G) together with a set of unordered pairs of these elements, called "edges" denoted by E(G). The set of vertices of the graph G is called "the vertex -set of G " and the list of edges is called "the edge -list of G " (Gibbons A., 1985), (Giblin P.J., 1977).