In this ˑwork, we present theˑ notion of the ˑgraph for a KU-semigroup as theˑundirected simple graphˑ with the vertices are the elementsˑ of and weˑˑstudy the ˑgraph ofˑ equivalence classesˑofˑ which is determinedˑ by theˑ definition equivalenceˑ relation ofˑ these verticesˑ, andˑ then some related ˑproperties areˑ given. Several examples are presented and some theorems are proved. Byˑ usingˑ the definitionˑ ofˑ isomorphicˑ graph, ˑwe showˑ thatˑ the graphˑ of equivalence ˑclasses ˑand the ˑgraphˑof ˑa KU-semigroup ˑ areˑ theˑ sameˑ, in special cases.
Research aimed to:1- Be acquainted to the two types of personality A,B with the members of the teaching staff of Anbar university 2- The level of the motivational achievement among the teaching staff 3- The level of motivational achievement of the teaching staff of( A,B). 4- Differences of the abstract implications of A,B type 5- The relationship between A and B and the motivational achievement.
Research Tools: the researchers followed measure A, B type of Howard Glaser 1978,and measure of Achievement Motivation for Mansoorm1986.
The Result showed: 1. A tendency of the t
... 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.
An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin
... Show MoreIn this work, we study of the concept of a cubic set of a semigroup in KU-algebra. Firstly, we study a cubic sub KU-semigroup and achieve some results in this notion. And then, we get a relation between a cubic sub KU-semi group and a level set of a cubic set. Moreover, we define some cubic ideals of this structure and we found relationships between these ideals.
2010 AMS Classification. 08A72, 03G25, 06F35
In this research we prepared shiff bases unilateral claw( benzyl imine aniline ) and Bilateral claw ( benzayal-2-imine phenol ) in high purity reach to 98% , which it's prepared from aromatic amine with aldehydes, it's solid,thermosetting, not dissolved in water in general. Diagnosed prepared article by using infra red spectroscopy (IR) which shows azomethen grop at 1640cm-1 At this diagnosis we suggest tetra headral mechanism in this Circumstances For a reaction.
This study was aimed to reduce the amount of the sprayed solution lost during trees spraying. At the same time, the concentration of the sprayed solution on the target (tree or bush) must be ensured and to find the best combination of treatments. Two factors controls the spraying process: (i) spraying speed (1.2 km/h, 2.4 km/h, 3.6 km/h), and (ii) the type of sensor. The test results showed a significant loss reduction percentage. It reached (6.05%, 5.39% and 2.05%) at the speed (1.2 km/h, 2.4 km/h, 3.6 km/h), respectively. It was noticed that when the speed becomes higher the loss becomes less accordingly. The interaction between the 3.6 km/h speed and the type of Ultrasonic sensor led to a decrease in the percentage of the spray
... Show MoreA graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show MoreF index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds
The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.