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 is either two or five only.
The study aimed to identify the level of awareness of mental health among the students of the Universities of Palestine Technical and Jerusalem open in the city of Tulkarem from the perspective of the students and the population of the study ( 8091 ) students at the two universities , and selected intentional sample size was ( 445 ) students , and used the tool questionnaire to measure responses of subjects , and the results showed that there are differences depending on the variable sex and was in favor of females , and depending on the variable University , and was in favor of the Al-Quds Open / variable Study level for the benefit of students of second year , did not show statistical differences depending on the variables of c
... Show MoreIn this paper, we introduce and study the notions of fuzzy quotient module, fuzzy (simple, semisimple) module and fuzzy maximal submodule. Also, we give many basic properties about these notions.
Let be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset is a minimum neighborhood dominating set if is a dominating set and if for every holds. The minimum cardinality of the minimum neighborhood dominating set of a graph is called as minimum neighborhood dominating number and it is denoted by . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the
... 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
In this paper, we introduce and study new types of soft open sets and soft closed
sets in soft bitopological spaces (X,~ ,~ ,E) 1 2 , namely, (1,2)*-maximal soft open
sets, (1,2)*-maximal soft (1,2)*-pre-open sets, semi (1,2)*-maximal soft (1,2)*-preopen
sets, (1,2)*-maximal soft closed sets, (1,2)*-maximal soft (1,2)*-pre-closed
sets, (1,2)*-minimal soft open sets, (1,2)*-minimal soft (1,2)*-pre-open sets, (1,2)*-
minimal soft closed sets, (1,2)*-minimal soft (1,2)*-pre-closed sets, and semi (1,2)*-
minimal soft (1,2)*-pre-closed sets. Also, properties and the relation among these
concepts have been studied.
Background: In Ulcerative colitis (UC), the presence of a persistently elevated number of T cells in the inflamed area with respect to the activity of the disease suggesting bad prognosis. This study was done to evaluate cellular immune response in different disease activity patterns and its possible implication in evaluation of disease activity.
Materials and methods: This study included Forty seven archived paraffin-embedded samples of ulcerative colitis; these samples diagnosed and graded for disease activity. Then dual
immunofluorescence staining was used for phenotyping of lymphocytic infiltrate (CD3- CD19) and (CD4-CD8). A total and differential T cell as well as plasma cell count was recorded in thes
Let S be a commutative ring with identity, and A is an S-module. This paper introduced an important concept, namely strongly maximal submodule. Some properties and many results were proved as well as the behavior of that concept with its localization was studied and shown.
This research aimed at identifying the factors that affecting in the recruitment of a teaching staff for the Massive Open Online Courses (MOOCs) in university teaching at the University of Khartoum. The descriptive method was followed. The questionnaire was used as a tool for data collection,, which was distributed directly to a sample of (181) respondent of the teaching staff members of the senate at University of Khartoum from those who were attend at the senate meeting No. (409) which was held on 22 August 2016 Of (272). The researcher followed for the distribution the chance method, where each questionnaire was distributed to each of a teaching staff from different faculties at the University of Khartoum, according to his willingness
... Show MoreRice (Oryza sativa) is a fundamental food for the majority of world population. Cyclin Dependent Kinase -A (CDKA) accelerates transition through different stages of cell cycle and contributes in gametes formation. In the present investigation, a CDKA encoding gene along with the corresponding protein were characterized in O. sativa Indica Group, O. glaberrima, O. barthii, O. brachyantha, O. glumipatula, O. longistaminata, O. meridionalis, O. nivara, O. punctata and O. rufipogon using in silico analyses. The results reflected little variation in most species except O. longistaminata and O. brachyantha. Compared with the remaining species, O. longistaminata
... Show MoreIn this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.