In this paper, the concept of a hyper structure KU-algebra is introduced and some related properties are investigated. Also, some types of hyper KU-algebras are studied and the relationship between them is stated. Then a hyper KU-ideal of a hyper structure KU-algebra is studied and a few properties are obtained. Furthermore, the notion of a homomorphism is discussed.

We have studied some types of ideals in a KU-semigroup by using the concept of a bipolar fuzzy set. Bipolar fuzzy S-ideals and bipolar fuzzy k-ideals are introduced, and some properties are investigated. Also, some relations between a bipolar fuzzy k-ideal and k-ideal are discussed. Moreover, a bipolar fuzzy k-ideal under homomorphism and the product of two bipolar fuzzy k-ideals are studied.

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the

The research is an article that teaches some classes of fully stable Banach - Å modules. By using Unital algebra studies the properties and characterizations of all classes of fully stable Banach - Å modules. All the results are existing, and they've been listed to complete the requested information.

Assume that G ≅ HN the Harada–Norton group. In this paper, effective investment for the graph ΓRI HN standard features to acquire meaningful algebraic results for the graph ΓRI HN and its corresponding group HN. For instance, marketing a modern methods to understand the way of create a precise small subgroups in G. Furthermore, performing a full investigation for getting particular ΓRI HN parameters.

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.

In this paper the full stable Banach gamma-algebra modules, fully stable Banach gamma-algebra modules relative to ideal are introduced. Some properties and characterizations of these classes of full stability are studied.

In this work, a deep computational study has been conducted to assign several qualities for the graph ⁠. Furthermore, determine the amount of the dihedral subgroups in the Held simple group He through utilizing the attributes of gamma.

This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermor

Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an