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

This work aims to introduce the concepts of left and right derivations in an AT-algebra and discuss some interesting theorems of these concepts. Also, a fuzzy derivation of an AT-subalgebra, a fuzzy right (left) derivation ideal, a fuzzy derivation of AT-subalgebra, and a fuzzy right (left) derivation ideal are studied. Finally, a level derivation of AT-algebras is defined and some propositions are achieved.

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.

The concept of fully pseudo stable Banach Algebra-module (Banach A-module) which is the generalization of fully stable Banach A-module has been introduced. In this paper we study some properties of fully stable Banach A-module and another characterization of fully pseudo stable Banach A-module has been given.

Topological indices provide important insights into the structural characteristics of molecular graphs. The present investigation proposes and explores a creative graph on a finite group G, which is known as the RIG. This graph is designated as ΓRS G2(4) indicating a simple undirected graph containing elements of G. Two distinct ertices are regarded as nearly the same if and only if their sum yields a non-trivial involution element in G. RIGs have been discovered in various finite groups. We examine several facets of the RIG by altering the graph through the conjugacy classes of G. Furthermore, we investigate the topological indices as applications in graph theory applying the distance matrix of the G2(4) group.

Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).

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 paper, a design of the broadband thin metamaterial absorber (MMA) is presented. Compared with the previously reported metamaterial absorbers, the proposed structure provides a wide bandwidth with a compatible overall size. The designed absorber consists of a combination of octagon disk and split octagon resonator to provide a wide bandwidth over the Ku and K bands' frequency range. Cheap FR-4 material is chosen to be a substate of the proposed absorber with 1.6 thicknesses and 6.5×6.5 overall unit cell size. CST Studio Suite was used for the simulation of the proposed absorber. The proposed absorber provides a wide absorption bandwidth of 14.4 GHz over a frequency range of 12.8-27.5 GHz with more than %90 absorp

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological