In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has complete induced subgraphs with order or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius and diameter are studied here.
The Syriac language is one of the ancient Semitic languages that appeared in the first century AD. It is currently used in a number of cities in Iraq, Turkey, and others. In this research paper, we tried to apply the work of Ali and Mahmood 2020 on the letters and words in the Syriac language to find a new encoding for them and increase the possibility of reading the message by other people.
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 MoreThe recent developments in information technology have made major changes in all fields. The transfer of information through networks has become irreplaceable due to its advantages in facilitating the requirements of modern life through developing methods of storing and distributing information. This in turn has led to an increase in information problems and risks that threaten the security of the institution’s information and can be used in distributed systems environment.
This study focused on two parts; the first is to review the most important applications of the graph theory in the field of network security, and the second is focused on the possibility of using the Euler graph as a Method Object that is employed in Re
... Show MoreIn this work we define and study new concept of fibrewise topological spaces, namely fibrewise soft topological spaces, Also, we introduce the concepts of fibrewise closed soft topological spaces, fibrewise open soft topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces.
Several Intrusion Detection Systems (IDS) have been proposed in the current decade. Most datasets which associate with intrusion detection dataset suffer from an imbalance class problem. This problem limits the performance of classifier for minority classes. This paper has presented a novel class imbalance processing technology for large scale multiclass dataset, referred to as BMCD. Our algorithm is based on adapting the Synthetic Minority Over-Sampling Technique (SMOTE) with multiclass dataset to improve the detection rate of minority classes while ensuring efficiency. In this work we have been combined five individual CICIDS2017 dataset to create one multiclass dataset which contains several types of attacks. To prove the eff
... Show MoreLet G be a finite group and X be a G-conjugacy of elements of order 3. The A4-graph of G is a simple graph with vertex set X and two vertices x,yÎX are linked if x≠ y and xy-1 is an involution element. This paper aims to investigate the A4-graph properties for the monster Held group He.
The primary objective of this paper is to present a new concept of fibrewise topological spaces over B is said to be fibrewise slightly topological spaces over B. Also, we introduce the concepts of fibrewise slightly perfect topological spaces, filter base, contact point, slightly convergent, slightly directed toward a set, slightly adherent point, slightly rigid, fibrewise slightly weakly closed, H.set, fibrewise almost slightly perfect, slightly∗ .continuous fibrewise slightly∗ topological spaces respectively, slightly Te, locally QHC, In addition, we state and prove several propositions related to these concepts.
In this paper, we define some generalizations of topological group namely -topological group, -topological group and -topological group with illustrative examples. Also, we define grill topological group with respect to a grill. Later, we deliberate the quotient on generalizations of topological group in particular -topological group. Moreover, we model a robotic system which relays on the quotient of -topological group.
The essential objective of this paper is to introduce new notions of fibrewise topological spaces on D that are named to be upper perfect topological spaces, lower perfect topological spaces, multi-perfect topological spaces, fibrewise upper perfect topological spaces, and fibrewise lower perfect topological spaces. fibrewise multi-perfect topological spaces, filter base, contact point, rigid, multi-rigid, multi-rigid, fibrewise upper weakly closed, fibrewise lower weakly closed, fibrewise multi-weakly closed, set, almost upper perfect, almost lower perfect, almost multi-perfect, fibrewise almost upper perfect, fibrewise almost lower perfect, fibrewise almost multi-perfect, upper* continuous fibrewise upper∗ topol
... Show More