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.
Assume that G is a finite group and X = tG where t is non-identity element with t3 = 1. The simple graph with node set being X such that a, b ∈ X, are adjacent if ab-1 is an involution element, is called the A4-graph, and designated by A4(G, X). In this article, the construction of A4(G, X) is analyzed for G is the twisted group of Lie type 3D4(3).
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 More
(3)
Abstact:
Nursery is one of educational institution in the process of developing the
social concepts that it includes a quirking the knowledge and experiences that
help the kid to adjust with environment through arrangement words ,
movements and concrete things which are transferred to the kids so as to
realize these concepts .
Social concepts are numbers of words and statements with social nature
which the kids learn through the family or nursery in order to effect their
educational style of independent and helping the others .
The re searcher adopted this theory because of the little studies in the
filed of social concepts in the nursery.
The aims of the study are as following :
1- building tools for
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.
(18)
(12)
This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima
... Show More
(7)
(3)
(61)
(53)
In this paper we introduce a new type of functions called the generalized regular
continuous functions .These functions are weaker than regular continuous functions and
stronger than regular generalized continuous functions. Also, we study some
characterizations and basic properties of generalized regular continuous functions .Moreover
we study another types of generalized regular continuous functions and study the relation
among them
Form the series of generalization of the topic of supra topology is the generalization of separation axioms . In this paper we have been introduced (S * - SS *) regular spaces . Most of the properties of both spaces have been investigated and reinforced with examples . In the last part we presented the notations of supra *- -space ( =0,1) and we studied their relationship with (S * - SS *) regular spaces.