Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).
Let be any connected graph with vertices set and edges set . For any two distinct vertices and , the detour distance between and which is denoted by is a longest path between and in a graph . The detour polynomial of a connected graph is denoted by ; and is defined by . In this paper, the detour polynomial of the theta graph and the uniform theta graph will be computed.
The Syriac language is one of the ancient Semitic languages that appeared in the first century AD. It is currently used in a number of cities in Iraq, Turkey, and others. In this research paper, we tried to apply the work of Ali and Mahmood 2020 on the letters and words in the Syriac language to find a new encoding for them and increase the possibility of reading the message by other people.
Suppose that is a finite group and is a non-empty subset of such that and . Suppose that is the Cayley graph whose vertices are all elements of and two vertices and are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by that is a graph with vertex set consists of all column matrices which all components are in and two vertices and are adjacent if and only if , where is a column matrix that each entry is the inverse of similar entry of and is matrix with all entries in , is the transpose of and . In this paper, we clarify some basic properties of the new graph and assign the structure of when is complete graph , complete bipartite graph and complete
... Show MoreElectrical Discharge Machining (EDM) is a non-traditional cutting technique for metals removing which is relied upon the basic fact that negligible tool force is produced during the machining process. Also, electrical discharge machining is used in manufacturing very hard materials that are electrically conductive. Regarding the electrical discharge machining procedure, the most significant factor of the cutting parameter is the surface roughness (Ra). Conventional try and error method is time consuming as well as high cost. The purpose of the present research is to develop a mathematical model using response graph modeling (RGM). The impact of various parameters such as (current, pulsation on time and pulsation off time) are studied on
... Show MoreThe purpose of this resesrh know (the effectiveness of cooperative lerarning implementation of floral material for calligraphy and ornamentation) To achieve the aim of the research scholar put the two zeros hypotheses: in light of the findings of the present research the researcher concluded a number of conclusions, including: -
1 - Sum strategy helps the learner to be positive in all the information and regulations, monitoring and evaluation during the learning process.
2 - This strategy helps the learner to use information and knowledge and their use in various educational positions, and to achieve better education to increase its ability to develop thinking skills and positive trends towards the article.
In light of this, the
A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties
In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show MoreIn this paper, we introduce and study the notion of the maximal ideal graph of a commutative ring with identity. Let R be a commutative ring with identity. The maximal ideal graph of R, denoted by MG(R), is the undirected graph with vertex set, the set of non-trivial ideals of R, where two vertices I1 and I2 are adjacent if I1 I2 and I1+I2 is a maximal ideal of R. We explore some of the properties and characterizations of the graph.
In this work, the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt
... Show More