Chaotic graph is a graph which carries physical characters with density variation; the
density of chaotic graphs can be fixed and unique or different, according to this the
representation of the chaoticgraphs by matrices is different to normal chaotic graphs.
Firstly, we will discuss the idea of chaotic graphs with density variation showing how to
obtain the adjacency and incidence matrix for each different case, and then we will discuss
the idea of folding for simple chaotic graphs with density variation showing two types of
folding chaotic graphs, the first type of folding is known as topological folding; the second
type of folding concerns folding a vertex into another vertex and folding physical
characteristics into their selves, in each case we will discuss the decrease or increase the
degree of density