. 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 which is a graph with a vertex set consisting of all column matrices in 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 the similar entry of and is matrix with all entries in , is the transpose of and and m . We aim to provide some basic properties of the new graph and determine the structure of when is a complete graph for every , and n, m .
In this paper, we estimate the survival function for the patients of lung cancer using different nonparametric estimation methods depending on sample from complete real data which describe the duration of survivor for patients who suffer from the lung cancer based on diagnosis of disease or the enter of patients in a hospital for period of two years (starting with 2012 to the end of 2013). Comparisons between the mentioned estimation methods has been performed using statistical indicator mean squares error, concluding that the survival function for the lung cancer by using shrinkage method is the best
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.
A complete metric space is a well-known concept. Kreyszig shows that every non-complete metric space can be developed into a complete metric space , referred to as completion of .
We use the b-Cauchy sequence to form which “is the set of all b-Cauchy sequences equivalence classes”. After that, we prove to be a 2-normed space. Then, we construct an isometric by defining the function from to ; thus and are isometric, where is the subset of composed of the equivalence classes that contains constant b-Cauchy sequences. Finally, we prove that is dense in , is complete and the uniqueness of is up to isometrics
The article describes a certain computation method of -arcs to construct the number of distinct -arcs in for . In this method, a new approach employed to compute the number of -arcs and the number of distinct arcs respectively. This approach is based on choosing the number of inequivalent classes } of -secant distributions that is the number of 4-secant, 3-secant, 2-secant, 1-secant and 0-secant in each process. The maximum size of -arc that has been constructed by this method is . The new method is a new tool to deal with the programming difficulties that sometimes may lead to programming problems represented by the increasing number of arcs. It is essential to reduce the established number of -arcs in each cons
... Show MoreIn this paper, we introduce and study the concept of a new class of generalized closed set which is called generalized b*-closed set in topological spaces ( briefly .g b*-closed) we study also. some of its basic properties and investigate the relations between the associated topology.
R. Vasuki [1] proved fixed point theorems for expansive mappings in Menger spaces. R. Gujetiya and et al [2] presented an extension of the main result of Vasuki, for four expansive mappings in Menger space. In this article, an important lemma is given to prove that the iteration sequence is Cauchy under suitable condition in Menger probabilistic G-metric space (shortly, MPGM-space). And then, used to obtain three common fixed point theorems for expansive type mappings.
An edge dominating set of a graph is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G. The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin
... Show MoreThis paper contains an equivalent statements of a pre- space, where are considered subsets of with the product topology. An equivalence relation between the preclosed set and a pre- space, and a relation between a pre- space and the preclosed set with some conditions on a function are found. In addition, we have proved that the graph of is preclosed in if is a pre- space, where the equivalence relation on is open.
On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that
... Show MoreIn this paper a Г-ring M is presented. We will study the concept of orthogonal generalized symmetric higher bi-derivations on Г-ring. We prove that if M is a 2-torsion free semiprime Г-ring , and are orthogonal generalized symmetric higher bi-derivations associated with symmetric higher bi-derivations respectively for all n ϵN.