Let R be a commutative ring , the pseudo – von neuman regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph denoted by P-VG(R) , in this work we got some new results a bout chromatic number of P-VG(R).
The present study, entitled “ linguistic characteristics (the morphology - nominal suffixes ) of a number of (Quriyat or koyrat ) by the poet Kamal Mustafa Daquqli, aims at studying and making a comparison between Turkmen dialect written and spoken forms that show many of the hidden language structures. Similarly, the study sheds light on the poet as one of the most prominent literary figures in Turkmenistan literature.
Turkman Quriyat is one of Turkman blank verse significant forms. Apart from (songs and Quriyat) and until the 19th C., folk poetry has been stalled for a long time but reclaimed its literary high position in the middle of the 20th C.
The study introduction briefly discusses Tu
... Show MoreThe objective of this study is to determine the extent to which the determinants of organizational support contributed to enhancing the mental status of banking services in a number of banks in Dohuk governorate in order to diagnose the correlation between the perceived organizational support and the mental status of services. Availability in the environment of banks and to enhance the mental position from the point of view of customers as the main hypotheses focused on the nature of the relationship between the dimensions of research among them has been tested these hypotheses using statistical and descriptive methods have been The study concluded that the contribution of organizational support, which is
... Show MoreConsider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs derived from the group and a few classes of zero-divisor graphs of the commutative ring R are examined.
Let R be a commutative ring with identity, and let M be a unity R-module. M is called a bounded R-module provided that there exists an element x?M such that annR(M) = annR(x). As a generalization of this concept, a concept of semi-bounded module has been introduced as follows: M is called a semi-bounded if there exists an element x?M such that . In this paper, some properties and characterizations of semi-bounded modules are given. Also, various basic results about semi-bounded modules are considered. Moreover, some relations between semi-bounded modules and other types of modules are considered.
The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreAntimagic labeling of a graph with vertices and edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph are pairwise distinct. Where the vertex-weights of a vertex under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph , strong face fan graph , strong face prism graph and finally strong face friendship graph .
In this paper, we built a mathematical model for convection and thermal radiation heat transfer of fluid flowing through a vertical channel with porous medium under effects of horizontal magnetic field (MF) at the channel. This model represents a 2-dimensional system of non-linear partial differential equations. Then, we solved this system numerically by finite difference methods using Alternating Direction Implicit (ADI) Scheme in two phases (steady state and unsteady state). Moreover, we found the distribution and behaviour of the heat temperature inside the channel and studied the effects of Brinkman number, Reynolds number, and Boltzmann number on the heat temperature behaviour. We solved the system by buildi
... Show MoreThe main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.