The purpose of this article is to partition PG(3,11) into orbits. These orbits are studied from the view of caps using the subgroups of PGL(4,11) which are determined by nontrivial positive divisors of the order of PG(3,11). The τ_i-distribution and c_i-distribution are also founded for each cap.

The aim of study to evaluated cinnamic acid and its activity on complete blood count(RBC,WBC,HG,HCV,MCH,MCHC and Plat.)and removed the cytoxan damage which caused bone marrow failure and leukemia and other that due to linked the cytoxan in 7- nitrogen of guanine based of DNA that lead to dead cells. Two concentration from pure cinnamic acid (5.6, 2.8 mg ? mice weight) in first step to choice the perfect concentration in comparison with each negative control ,positive control of cytoxan and the comparison group represent vitamin C. The second step to understand cinnamic acid mechanism activity towards cytoxan by used pre- cytoxan and post – cytoxan in interaction with perfect concentration of cinnamic acid dose (2.8 mg ? mice we

Assume that  is a meromorphic fuction of degree n where X is compact Riemann surface of genus g. The meromorphic function gives a branched cover of the compact Riemann surface X. Classes of such covers are in one to one correspondence with conjugacy classes of r-tuples (  of permutations in the symmetric group , in which  and s generate a transitive subgroup G of  This work is a contribution to the classification of all primitive groups of degree 7, where X is of genus one.

    In this paper further properties of the fuzzy complete a-fuzzy normed algebra have been introduced. Then we found the relation between the maximal ideals of fuzzy complete a-fuzzy normed algebra and the associated multiplicative linear function space. In this direction we proved that if  is character on Z then ker is a maximal ideal in Z. After this we introduce the notion structure of the a-fuzzy normed algebra then we prove that the structure, st(Z) is -fuzzy closed subset of fb(Z, ) when  (Z,  , , ) is a commutative fuzzy complete a-fuzzy normed algebra with identity e.

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

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

              In this paper, the packing problem for complete (  4)-arcs in  is partially solved. The minimum and the maximum sizes of complete (  4)-arcs in  are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. Also, this paper establishes the connection between the projective geometry in terms of a complete ( , 4)-arc in  and the algebraic characteristics of a plane quartic curve over the field  represented by the number of its rational points and inflexion points. In addition, some sizes of complete (  6)-arcs in the projective plane of order thirteen are established, namely for  = 53, 54, 55, 56.

This paper introduces some properties of separation axioms called α -feeble regular and α -feeble normal spaces (which are weaker than the usual axioms) by using elements of graph which are the essential parts of our α -topological spaces that we study them. Also, it presents some dependent concepts and studies their properties and some relationships between them.

Graph  is a tool that can be used to simplify and solve network problems. Domination is a typical network problem that graph theory is well suited for. A subset of nodes in any network is called dominating if every node is contained in this subset, or is connected to a node in it via an edge. Because of the importance of domination in different areas, variant types of domination have been introduced according to the purpose they are used for. In this paper, two domination parameters the first is the restrained and the second is secure domination have been chosn. The secure domination, and some types of restrained domination in one type of trees is called complete ary tree  are determined.