In this paper we generalize Jacobsons results by proving that any integer  in   is a square-free integer), belong to . All units of  are generated by the fundamental unit  having the forms

Our generalization build on using the conditions

This leads us to classify the real quadratic fields  into the sets  Jacobsons results shows that  and Sliwa confirm that  and  are the only real quadratic fields in .

Suppose that  is a finite group and  is a non-empty subset of  such that  and . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by  that  is a graph with vertex set consists of all column matrices  which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and . In this paper, we clarify some basic properties of the new graph and assign the structure of  when  is complete graph , complete bipartite graph  and complete

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. Furthermor

Anomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the

This paper presents the implementation of a complex fractional order proportional integral derivative (CPID) and a real fractional order PID (RPID) controllers. The analysis and design of both controllers were carried out in a previous work done by the author, where the design specifications were classified into easy (case 1) and hard (case 2) design specifications. The main contribution of this paper is combining CRONE approximation and linear phase CRONE approximation to implement the CPID controller. The designed controllers-RPID and CPID-are implemented to control flowing water with low pressure circuit, which is a first order plus dead time system. Simulation results demonstrate that while the implemented RPID controller fails to stabi

        In this paper, the necessary optimality conditions are studied and derived for a new class of the sum of two Caputo–Katugampola fractional derivatives of orders (α, ρ) and( β,ρ) with fixed the final boundary conditions. In the second study, the approximation of the left Caputo-Katugampola fractional derivative was obtained by using the shifted Chebyshev polynomials. We also use the Clenshaw and Curtis formula to approximate the integral from -1 to 1. Further, we find the critical points using the Rayleigh–Ritz method. The obtained approximation of the left fractional Caputo-Katugampola derivatives was added to the algorithm applied to the illustrative example so that we obtained the approximate results for the stat

         Let R be a commutative ring , the pseudo – von neuman  regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if   , this graph denoted by P-VG(R) ,  in this work we got some new results a bout chromatic number of  P-VG(R).

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 

Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A₄-graph of  G, as a simple graph denoted by A₄(G,X) which has X as a vertex set. Two vertices,  x and y, are adjacent if and only if  x≠y and  x y^-1=y x^-1. General properties  of the A₄-graph as well as the structure of A₄(G,X) when G@ ³D₄(2) will be studied.

In this paper we generalize Jacobsons results by proving that any integer  in   is a square-free integer), belong to . All units of  are generated by the fundamental unit  having the forms

our generalization build on using the conditions

This leads us to classify the real quadratic fields  into the sets  Jacobsons results shows that  and Sliwa confirm that  and  are the only real quadratic fields in .