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.
This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.
The research abstract included introduction and the importance of the research, also included display of the problem represented by weakness for the players when performing some of the basic skills in badminton and the shuttle not reaching to the back corners of the court which gives the player the opportunity to win through applying the pressure on the opponent and make him away from the control center(T) which definitely required level of a collection muscular strength contributed in performance perhaps this related to a number of reasons related with weakness in physical changes especially explosive and characterized by speed forces for the badminton players and be acquainted with them and knowing the extent of their effect in performanc
... Show MoreIt is shown that if a subset of a topological space (χ, τ) is δ-semi.closed, then it is semi.closed. By use this fact, we introduce the concept regularity of a topological space (χ, τ) via δ-semi.open sets. Many properties and results were investigated and studied. In addition we study some maps that preserve the δ-semi.regularity of spaces.
(11)
(13)
(2)
(1)
(1)
The aim of this research is to investigate the skills of the chemistry students from the Ibn Al-Haytham Education college of pure sciences in Baghdad in understanding and constructing graphical representations of data. The research sample consisted of (101) male and female students in their fourth year of study during the 2016-2017 academic year. This sample represents 71% of the total number of students in this group.The research methodology used consisted of two parts relating to 19 issues. The first part is an objective multi choice type of test to measure the student’s skill in selecting the right representation of specific subject graph amongst many provided. The second part concentrated on measuring the student’s skill in construc
... Show MoreThe basic concepts of some near open subgraphs, near rough, near exact and near fuzzy graphs are introduced and sufficiently illustrated. The Gm-closure space induced by closure operators is used to generalize the basic rough graph concepts. We introduce the near exactness and near roughness by applying the near concepts to make more accuracy for definability of graphs. We give a new definition for a membership function to find near interior, near boundary and near exterior vertices. Moreover, proved results, examples and counter examples are provided. The Gm-closure structure which suggested in this paper opens up the way for applying rich amount of topological facts and methods in the process of granular computing.
Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs derived from the group and a few classes of zero-divisor graphs of the commutative ring R are examined.
(6)
(3)
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 i
... Show More
There are two (non-equivalent) generalizations of Von Neuman regular rings to modules; one in the sense of Zelmanowize which is elementwise generalization, and the other in the sense of Fieldhowse. In this work, we introduced and studied the approximately regular modules, as well as many properties and characterizations are considered, also we study the relation between them by using approximately pointwise-projective modules.