A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

the research ptesents a proposed method to compare or determine the linear equivalence of the key-stream from linear or nonlinear key-stream

This article aims to estimate the partially linear model by using two methods, which are the Wavelet and Kernel Smoothers. Simulation experiments are used to study the small sample behavior depending on different functions, sample sizes, and variances. Results explained that the wavelet smoother is the best depending on the mean average squares error criterion for all cases that used.

In this paper the modified trapezoidal rule is presented for solving Volterra linear Integral Equations (V.I.E) of the second kind and we noticed that this procedure is effective in solving the equations. Two examples are given with their comparison tables to answer the validity of the procedure.