UNION AND INTERSECTION OF CHAOTIC GRAPHS WITH DENSITY VARIATION

Abstract

The aim of the present study is to discuss the union and intersection operations on chaotic graphs with density variation; the adjacency and incidence matrices representing the chaotic graphs induced from these operations will be introduced when physical characters of chaotic graphs have the same properties. There are several applications that have been utilized on chaotic graphs with density variation. The most practical applications of these kinds of operations on chaotic graphs with density variation are the internet signal speeds and the variation of green color for different parts of the plant. For example, in botany, in some cases, several plants suffer from a lack of chlorophyll in the damaged parts of the plant. In this case, the plant is represented by a chaotic graph, and the proportion of chlorophyll is represented by the density property, then the appropriate process is applied to increase the chlorophyll percentage in the appropriate place, so these operations help us to choose the suitable operator that satisfies our desires and requests. Keywords: adjacency matrix, incidence matrix, chaotic graph, density, union, intersection.