the research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream
We present the notion of bipolar fuzzy k-ideals with thresholds (
For a nonempty subset X of a group G and a positive integer m , the product of X , denoted by Xm ,is the set Xm = That is , Xm is the subset of G formed by considering all possible ordered products of m elements form X. In the symmetric group Sn, the class Cn (n odd positive integer) split into two conjugacy classes in An denoted Cn+ and Cn- . C+ and C- were used for these two parts of Cn. This work we prove that for some odd n ,the class C of 5- cycle in Sn has the property that = An n 7 and C+ has the property that each element of C+ is conjugate to its inverse, the square of each element of it is the element of C-, these results were used to prove that C+ C- = An exceptio
... Show MoreRecently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in is either a pendent vertex or a support vertex and has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.
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 MoreBackground: It was stated in scientific literatures that the entire craniofacial complex is influenced by the growth of the cranial base structures. Nevertheless, many times this is not the case, and this point is subject to great controversy so the aim of this study is to evaluate the possible differences in cranial base shape and flexure between different skeletal classes for both genders and to investigate any possible correlation between cranial base variables and other skeletal base variables. Materials and Methods: The sample include 75 lateral cephalometric radiographs of Iraqi adults aged between 18-25 years (39 males, 36 females), collected from patients and undergraduate students in the orthodontic department of College of Dentist
... Show MoreEnglish has for long been one of the most widely used media of communication globally, especially in the Malaysian universities. It has been termed as a Lingua Franca because it is shared with other languages which are considered first languages by different speakers. For this reason, English as a Lingua Franca (ELF) has attracted a number of researchers to investigate its variety via other languages in various communities. The objective of this paper is therefore to establish the strategies which are employing by the international students at the National University of Malaysia/ UniversitiKebangsaan Malaysia (UKM) as an example of one of the Malaysian universities; when they e
... Show MoreIn this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological
... Show More