Given an exterior algebra  over a finite dimension vector space v, and let   , where  is a graded ideal in . The relation between the algebra  and    regarding to -quadratic and - quadratic will be investigated. We show that the algebra   is - quadratic if and only if   is - quadratic. Furthermore, it has been shown that the algebra  is - quadratic if and only if  is - quadratic.

The recent developments in information technology have made major changes in all fields. The transfer of information through networks has become irreplaceable due to its advantages in facilitating the requirements of modern life through developing methods of storing and distributing information. This in turn has led to an increase in information problems and risks that threaten the security of the institution’s information and can be used in distributed systems environment.

This study focused on two parts; the first is to review the most important applications of the graph theory in the field of network security, and the second is focused on the possibility of using the Euler graph as a Method Object that is employed in Re

Inˑthis work, we introduce the algebraic structure of semigroup with KU-algebra is called KU-semigroup and then we investigate some basic properties of this structure. We define the KU-semigroup and several examples are presented. Also,we study some types of ideals in this concept such as S-ideal,k- ideal and P-ideal.The relations between these types of ideals are discussed and few results for product S-ideals of product KU-semigroups are given. Furthermore, few results of some ideals in KU-semigroup under homomorphism are discussed.

It is known that, the concept of hyper KU-algebras is a generalization of KU-algebras. In this paper, we define cubic (strong, weak,s-weak) hyper KU-ideals of hyper KU-algebras and related properties are investigated.

Research summary

Praise be to God, and prayers and peace be upon our master Muhammad, his family and companions until the Day of Judgment.

As for after:

It is the right of every nation to take care of its scientific heritage, and to reveal its human civilizational impact, and the Arabs are the richest nations in heritage, as they had in every period of time a sign and pride, the Arabs fulfilled their duty towards humanity, and they carried out a large part of their scientific activity towards humanity.

Therefore, highlighting some of the scientific aspects of the civilized activity of the Arabs, and removing some of the illusions spread by some malicious people, is a human duty before it is a national duty.

Recent years have seen an explosion in graph data from a variety of scientific, social and technological fields. From these fields, emotion recognition is an interesting research area because it finds many applications in real life such as in effective social robotics to increase the interactivity of the robot with human, driver safety during driving, pain monitoring during surgery etc. A novel facial emotion recognition based on graph mining has been proposed in this paper to make a paradigm shift in the way of representing the face region, where the face region is represented as a graph of nodes and edges and the gSpan frequent sub-graphs mining algorithm is used to find the frequent sub-structures in the graph database of each emotion. T

In this paper, the concept of a neutrosophic KU-algebra is introduced and some related properties are investigated. Also, neutrosophic KU-ideals of a neutrosophic KU-algebra are studied and a few properties are obtained. Furthermore, a few results of neutrosophic KU-ideals of a neutrosophic KU-algebra under homomorphism are discussed

In this work, we introduce an intuitionistic fuzzy ideal on a KU-semigroup as a generalization of the fuzzy ideal of a KU-semigroup. An intuitionistic fuzzy k-ideal and some related properties are studied. Also, a number of characteristics of the intuitionistic fuzzy k-ideals are discussed. Next, we introduce the concept of intuitionistic fuzzy k-ideals under homomorphism along with the Cartesian products.

     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.