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 .
The main objective of this work is to introduce and investigate fixed point (F. p) theorems for maps that satisfy contractive conditions in weak partial metric spaces (W.P.M.S), and give some new generalization of the fixed point theorems of Mathews and Heckmann. Our results extend, and unify a multitude of (F. p) theorems and generalize some results in (W.P.M.S). An example is given as an illustration of our results.
Praise be to Allah, the Lord of the Worlds.
Because it has a prominent role in the life of the Muslim person in particular, and in the stability, security, and safety of society in general, I found it appropriate to participate even a little in solving some of the problems that arise in the nation, and that Adello Badawi in this important issue that concerns everyone without exception And that I show that there are constants in the Koran, from which the scholars of the Ummah derived their evidence on this subject, and that there have been variables have occurred in some Islamic societies, in the issue of blood money that deserves the victim and his family, has allocated talk
The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that may be infinite. Furthermore, we offered some properties of such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.
The study aims to identify the degree of appreciation for the level of digital citizenship of a sample of Palestinian university students in the governorates of Gaza, and its relationship to the level of health awareness about the emerging coronavirus (covid-19). To achieve the objectives of the study, the researcher followed a descriptive approach by applying two questionnaires; the first, which consists of 30 items, was used to measure the level of digital citizenship. The second, which consists of 19 items, was used to measure the level of health awareness. Both questionnaires were applied on a sample of 367 students who were electronically selected using the manner simple randomness. Results have shown that the degr
... Show MoreThis paper aims to prove an existence theorem for Voltera-type equation in a generalized G- metric space, called the -metric space, where the fixed-point theorem in - metric space is discussed and its application. First, a new contraction of Hardy-Rogess type is presented and also then fixed point theorem is established for these contractions in the setup of -metric spaces. As application, an existence result for Voltera integral equation is obtained.
A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex. For a simple undirected graph G with order n, and let denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C
... Show MoreF index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds
A complete metric space is a well-known concept. Kreyszig shows that every non-complete metric space can be developed into a complete metric space , referred to as completion of .
We use the b-Cauchy sequence to form which “is the set of all b-Cauchy sequences equivalence classes”. After that, we prove to be a 2-normed space. Then, we construct an isometric by defining the function from to ; thus and are isometric, where is the subset of composed of the equivalence classes that contains constant b-Cauchy sequences. Finally, we prove that is dense in , is complete and the uniqueness of is up to isometrics
The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.