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.
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.
In this paper, a new type of supra closed sets is introduced which we called supra β*-closed sets in a supra topological space. A new set of separation axioms is defined, and its many properties are examined. The relationships between supra β*-Ti –spaces (i = 0, 1, 2) are studied and shown with instances. Additionally, new varieties of supra β*-continuous maps have been taken into consideration based on the supra β*-open sets theory.
(3)
(1)
(65)
(59)
Response of cross-ply plates subjected to transient load is obtained using five variables refined plate theory, and four variables plate theory. Equations of motion are derived through the principleof virtual work. Navier series used for simply supported laminated plates. The results of this work are presented for different parameters, such as the ply number, thickness, and modulus ratio with mechanical load (sinusoidal and step pulses), which are compared with those obtained using high-order shear plate theory. Five variables of refined plate theory give results that are considerably different from the four variables of refined plate theory and higher-order theory. The obtained results from the four variables theory have the same behavior
... Show MoreThis 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)
(23)
(16)
The purpose of this paper is to introduce and study the concepts of fuzzy generalized open sets, fuzzy generalized closed sets, generalized continuous fuzzy proper functions and prove results about these concepts.
(1)
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
(5)
(8)