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.
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 MoreThe finite element approach is used to solve a variety of difficulties, including well bore stability, fluid flow production and injection wells, mechanical issues and others. Geomechanics is a term that includes a number of important aspects in the petroleum industry, such as studying the changes that can be occur in oil reservoirs and geological structures, and providing a picture of oil well stability during drilling. The current review study concerned about the advancements in the application of the finite element method (FEM) in the geomechanical field over a course of century.
Firstly, the study presented the early advancements of this method by development the structural framework of stress, make numerical computer solution
... Show MoreThis 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 MoreThe aim of this paper is to study the Zariski topology of a commutative KU-algebra. Firstly, we introduce new concepts of a KU-algebra, such as KU-lattice, involutory ideal and prime ideal and investigate some basic properties of these concepts. Secondly, the notion of the topology spectrum of a commutative KU-algebra is studied and several properties of this topology are provided. Also, we study the continuous map of this topological space.
An intuitionistic fuzzy set was exhibited by Atanassov in 1986 as a generalization of the fuzzy set. So, we introduce cubic intuitionistic structures on a KU-semigroup as a generalization of the fuzzy set of a KU-semigroup. A cubic intuitionistic k-ideal and some related properties are introduced. Also, a few characterizations of a cubic intuitionistic k-ideal are discussed and new cubic intuitionistic fuzzy sets in a KU-semigroup are defined.
The result involution graph of a finite group , denoted by is an undirected simple graph whose vertex set is the whole group and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.
Graceful labeling of a graph with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex. In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph , graph, graph, jellyfish graph , Dragon graph , ki
... Show MoreIn this paper, we introduce the concept of cubic bipolar-fuzzy ideals with thresholds (α,β),(ω,ϑ) of a semigroup in KU-algebra as a generalization of sets and in short (CBF). Firstly, a (CBF) sub-KU-semigroup with a threshold (α,β),(ω,ϑ) and some results in this notion are achieved. Also, (cubic bipolar fuzzy ideals and cubic bipolar fuzzy k-ideals) with thresholds (α,β),(ω ,ϑ) are defined and some properties of these ideals are given. Relations between a (CBF).sub algebra and-a (CBF) ideal are proved. A few characterizations of a (CBF) k-ideal with threshol
... 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 More