A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.

        Throughout this paper, three concepts are introduced namely stable semisimple modules, stable t-semisimple modules and strongly stable t-semisimple. Many features co-related with these concepts are presented. Also many connections between these concepts are given. Moreover several relationships between these classes of modules and other co-related classes and other related concepts are introduced.

Let A be a unital algebra, a Banach algebra module M is strongly fully stable Banach A-module relative to ideal K of A, if for every submodule N of M and for each multiplier θ : N → M such that θ(N) ⊆ N ∩ KM. In this paper, we adopt the concept of strongly fully stable Banach Algebra modules relative to an ideal which generalizes that of fully stable Banach Algebra modules and we study the properties and characterizations of strongly fully stable Banach A-module relative to ideal K of A.

Let R be a 2-torision free prime ring and ?, ?? Aut(R). Furthermore, G: R×R?R is a symmetric generalized (?, ?)-Biderivation associated with a nonzero (?, ?)-Biderivation D. In this paper some certain identities are presented satisfying by the traces of G and D on an ideal of R which forces R to be commutative

Homomorphic encryption became popular and powerful cryptographic primitive for various cloud computing applications. In the recent decades several developments has been made. Few schemes based on coding theory have been proposed but none of them support unlimited operations with security.   We propose a modified Reed-Muller Code based symmetric key fully homomorphic encryption to improve its security by using message expansion technique. Message expansion with prepended random fixed length string provides one-to-many mapping between message and codeword, thus one-to many mapping between plaintext and ciphertext. The proposed scheme supports both (MOD 2) additive and multiplication operations unlimitedly.   We make an effort to prove

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

In this work, we study several features of the non-zero divisor graphs (ℵZD- graph) for the ring Zn of integer modulo n. For instance, the clique number, radius, girth, domination number, and the local clustering coefficient are determined. Furthermore, we present an algorithm that calculates the clique number and draws the non-zero divisor for the ring Zn.