The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs and , for some special graphs . The dominant metric dimension of is denoted by and the dominant metric dimension of corona product graph G and H is denoted by .
In this research for each positive integer integer and is accompanied by connecting that number with the number of Bashz Attabq result any two functions midwives to derive a positive integer so that there is a point
The global health crisis resulting from the spread of the Corona virus, which the World Health Organization described on January 30, 2020 as a public health emergency of international concern, then returned to describe it as a pandemic on March 11, 2020, and the measures and procedures taken by government authorities in different countries of the world, whether at the highest level of imposing a comprehensive curfew or what is called globally home quarantine and thus disrupting all sectors and activities in the state, whether public or private (with the exception of some sectors such as the health, media and security sectors), or at a lower level than that, such as reducing work rates in different sectors by rates that vary from one country
... Show MoreAn edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin
... Show MoreLet 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 this paper, we proved coincidence points theorems for two pairs mappings which are defined on nonempty subset in metric spaces by using condition (1.1). As application, we established a unique common fixed points theorems for these mappings by using the concept weakly compatible (R-weakly commuting) between these mappings.
The "Corona" pandemic that strikes the world has cast a shadow over contractual obligations, whether between individuals or companies, and emergency accidents and force majeure circumstances have a direct impact on them. Here, the legislation intervenes and sets the legal mechanisms to restore the obligations to their equal status and achieve the economic balance of the contract. Health crises are among the material facts whose effects are reflected and their features can be monitored on legal relations in general and contractual relations in particular, including the extent of the impact that this pandemic can have on the obligations that arise within the framework of a contractual relationship, which can be talked about in my theory Force
... Show MoreFacial 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
... Show MoreSuppose that
We define L-contraction mapping in the setting of D-metric spaces analogous to L-contraction mappings [1] in complete metric spaces. Also, give a definition for general D- matric spaces.And then prove the existence of fixed point for more general class of mappings in generalized D-metric spaces.