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

In this paper, third order non-polynomial spline function is used to solve 2nd kind Volterra integral equations. Numerical examples are presented to illustrate the applications of this method, and to compare the computed results with other known methods.

Praise be to God, prayer, and peace be upon the Messenger of Allah and his God and his companions. The field of the judiciary to prove or invalidate some cases in the field of proof of descent and attachment to the plaintiff or exile, and other legal and judicial issues, especially in this era where the spread of previously unknown evidence, such as DNA, which was discovered in 1953, and the genetic fingerprint discovered 1984, blood analysis and a Saliva, sweat, poetry, etc. in the field of forensic evidence, in forensic medicine or medical expertise, it can be used to identify the killer, or verify his identity, using all the evidence in the scene, such as a point of blood or sweat, and the like So, as well as to prove the lineage is u

In the present work, pattern recognition is carried out by the contrast and relative variance of clouds. The K-mean clustering process is then applied to classify the cloud type; also, texture analysis being adopted to extract the textural features and using them in cloud classification process. The test image used in the classification process is the Meteosat-7 image for the D3 region.The K-mean method is adopted as an unsupervised classification. This method depends on the initial chosen seeds of cluster. Since, the initial seeds are chosen randomly, the user supply a set of means, or cluster centers in the n-dimensional space.The K-mean cluster has been applied on two bands (IR2 band) and (water vapour band).The textural analysis is used

   In this paper we show that the function , () p fLI α ∈ ,0<p<1 where I=[-1,1] can be approximated by an algebraic polynomial with an error not exceeding , 1 ( , , ) kp ft n Ï• αω      where
,
1 ( , , ) kp ft n ϕ αω is the Ditizian–Totik modules of smoothness of unbounded function in , () p LI

In this paper, a new tunable approach for fusion the satellite images that fall in different electromagnetic wave ranges is presented, which gives us the ability to make one of the images features little superior on the other without reducing the general resultant image fusion quality, this approach is based on the principal component analysis (PCA) fusion method. A comparison made is between the results of the proposed approach and two fusion methods (they are: the PCA fusion method and the projection of eigenvectors on the bands fusion method), and the comparison results show the validity of this new method.

   This paper determined the difference between the first image of the natural and the second infected image by using logic gates. The proposed algorithm was applied in the first time with binary image, the second time in the gray image, and in the third time in the color image. At start of proposed algorithm the process  images by applying convolution to extended images with zero to obtain more vision and features then enhancements images by Edge detection filter (laplacion operator) and smoothing images by using mean filter ,In order to determine the change between the original image and the injury the logic gates applied specially X-OR gates . Applying the technique for tooth decay through this comparison can locate inj

This paper is concerned with the design and implementation of an image compression method based on biorthogonal tap-9/7 discrete wavelet transform (DWT) and quadtree coding method. As a first step the color correlation is handled using YUV color representation instead of RGB. Then, the chromatic sub-bands are downsampled, and the data of each color band is transformed using wavelet transform. The produced wavelet sub-bands are quantized using hierarchal scalar quantization method. The detail quantized coefficient is coded using quadtree coding followed by Lempel-Ziv-Welch (LZW) encoding. While the approximation coefficients are coded using delta coding followed by LZW encoding. The test results indicated that the compression results are com

In this paper, the Decomposition method was used to find approximation solutions for a system of linear Fredholm integral equations of the second kind. In this method the solution of a functional equations is considered as the sum of an infinite series usually converging to the solution, and Adomian decomposition method for solving linear and nonlinear integral equations. Finally, numerical examples are prepared to illustrate these considerations.