This dissertation depends on study of the topological structure in graph theory as well as introduce some concerning concepts, and generalization them into new topological spaces constructed using elements of graph. Thus, it is required presenting some theorems, propositions, and corollaries that are available in resources and proof which are not available. Moreover, studying some relationships between many concepts and examining their equivalence property like locally connectedness, convexity, intervals, and compactness. In addition, introducing the concepts of weaker separation axioms in α-topological spaces than the standard once like, α-feebly Hausdorff, α-feebly regular, and α-feebly normal and studying their properties. Furthermore, providing the necessary condition for α-feebly normality property to become hereditary. Also, using a new topological model for graphs are the edges represented as points which enables us to express in a topological language about combinatorial concepts. Moreover, showing that an α-connected orderable spaces are exactly α-topologized graphs. Finally, realizing the relationship between the α-topology on the vertex set and the once on the whole space by α-feebly regularity property.
The root-mean square-radius of proton, neutron, matter and charge radii, energy level, inelastic longitudinal form factors, reduced transition probability from the ground state to first-excited 2+ state of even-even isotopes, quadrupole moments, quadrupole deformation parameter, and the occupation numbers for some calcium isotopes for A=42,44,46,48,50 are computed using fp-model space and FPBM interaction. 40Ca nucleus is regarded as the inert core for all isotopes under this model space with valence nucleons are moving throughout the fp-shell model space involving 1f7/2, 2p3/2, 1f5/2, and 2p1/2 orbits. Model space is used to present calculations using FPBM intera
... Show More
(6)
(1)
Assume that G ≅ HN the Harada–Norton group. In this paper, effective investment for the graph ΓRI HN standard features to acquire meaningful algebraic results for the graph ΓRI HN and its corresponding group HN. For instance, marketing a modern methods to understand the way of create a precise small subgroups in G. Furthermore, performing a full investigation for getting particular ΓRI HN parameters.
Abstract The purpose of this paper is to preparing small games for fifth graders. And to identify the impact of these small games in developing some concepts of traffic safety for fifth graders. The two researchers used the experimental method to solve the research problem, and the research community was identified with students. The fifth grade of primary school in the province of Baghdad and a sample was chosen from the private Baghdad Primary School, which numbered (60) male and female students. They were distributed equally into two groups by simple random method (experimental and control groups). As for the most important conclusions reached by the two researchers, it is the presence of an effect of small games in developing some conce
... Show More
(1)
In this paper We introduce some new types of almost bi-periodic points in topological bitransfprmation groups and thier effects on some types of minimaliy in topological dynamics
In this work, the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt
... Show More
(4)
(3)
This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.
(13)
(5)
Electrical Discharge Machining (EDM) is a non-traditional cutting technique for metals removing which is relied upon the basic fact that negligible tool force is produced during the machining process. Also, electrical discharge machining is used in manufacturing very hard materials that are electrically conductive. Regarding the electrical discharge machining procedure, the most significant factor of the cutting parameter is the surface roughness (Ra). Conventional try and error method is time consuming as well as high cost. The purpose of the present research is to develop a mathematical model using response graph modeling (RGM). The impact of various parameters such as (current, pulsation on time and pulsation off time) are studied on
... Show More
(1)
Loanwords are the words transferred from one language to another, which become essential part of the borrowing language. The loanwords have come from the source language to the recipient language because of many reasons. Detecting these loanwords is complicated task due to that there are no standard specifications for transferring words between languages and hence low accuracy. This work tries to enhance this accuracy of detecting loanwords between Turkish and Arabic language as a case study. In this paper, the proposed system contributes to find all possible loanwords using any set of characters either alphabetically or randomly arranged. Then, it processes the distortion in the pronunciation, and solves the problem of the missing lette
... Show More
(3)
(4)
In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.