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 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

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.

   This 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 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

Coronavirus disease 2019 (COVID-19) caused by severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) has become a pandemic worldwide. On a daily basis the number of deaths associated with COVID-19 is rapidly increasing. The main transmission route of SARS-CoV-2 is through the air (airborne transmission). This review details the airborne transmission of SARS-CoV-2, the aerodynamics, and different modes of transmission (e.g. droplets, droplet nuclei, and aerosol particles). SARS-CoV-2 can be transmitted by an infected person during activities such as expiration, coughing, sneezing, and talking. During such activities and some medical procedures, aerosols and droplets contaminated with SARS-CoV-2 particles are formed. Depending on their

     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

F 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

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .