Figure - available from: Mathematical Problems in Engineering
This content is subject to copyright. Terms and conditions apply.
Source publication
Studying the orbit of an element in a discrete dynamical system is one of the most important areas in pure and applied mathematics. It is well known that each graph contains a finite (or infinite) number of elements. In this work, we introduce a new analytical phenomenon to the weighted graphs by studying the orbit of their elements. Studying the w...
Similar publications
Recently, mathematicians have been interested in studying the theory of discrete dynamical system, specifically difference equation, such that considerable works about discussing the behavior properties of its solutions (boundedness and unboundedness) are discussed and published in many areas of mathematics which involves several interesting result...
Citations
... The Sombor index defined in [8] as ...
Let G be a directed graph of order n. Recently, Sombor index was defined in topological graph indices and got a rapid investigation. In this paper, we calculated the the Sombor index for multi-monad graphs.
... This note is a continuous work to [9]. The orbit for given initial weight-edge u i such as: ...
... By Shukur and Shelash, the monad was extended to be multi-monad defined by the following in [7]. For more details, see [5] where is the number of the united cycles ...
Graph energy is the sum of the absoult value of the eigenvalues of adjacency matrix of the graph. In this paper, we consider multi-monad graphs and calculate their energy.
Its well known that there are a limited number of method which associate group theory to graph theory. n this paper, we propose a new method and obtain a novel kind of graphs. Some important application like graph energy was established to the proposed graph.
Let G be a finite group and Γ be a graph of a finite order. How G and Γ are involved? this question got interest of a large number of mathematicians among them Arthur Cayley, Pual Erdos, and Vector Arnold.
The complex network is very active area in dynamical systems studies. The complex network is a set of nods (vertexes) which can be represented by a graph. Recently, multi-monad graph was introduced by Shukur and Shelash as a united of monad graphs. In this paper, we study the complexity of multi-monad graphs.
