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

This booklet contains the basic data and graphs forCOVID-19 in Iraq during the first three months of thepandemic ( 24 February to 19 May - 2020 ) , It isperformed to help researchers regarding this health problem (PDF) Information Booklet COVID-19 Graphs For Iraq First 3 Months. Available from: https://www.researchgate.net/publication/341655944_Information_Booklet_COVID-19_Graphs_For_Iraq_First_3_Months#fullTextFileContent [accessed Oct 26 2024].

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

In this paper, Nordhaus-Gaddum type relations on open support independence number of some derived graphs of path related graphs under addition and multiplication are studied.

In this paper we generalize some of the results due to Bell and Mason on a near-ring N admitting a derivation D , and we will show that the body of evidence on prime near-rings with derivations have the behavior of the ring. Our purpose in this work is to explore further this ring like behavior. Also, we show that under appropriate additional hypothesis a near-ring must be a commutative ring.