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

Image compression has become one of the most important applications of the image processing field because of the rapid growth in computer power. The corresponding growth in the multimedia market, and the advent of the World Wide Web, which makes the internet easily accessible for everyone. Since the early 1980, digital image sequence processing has been an attractive research area because an image sequence, as acollection of images, may provide much compression than a single image frame. The increased computational complexity and memory space required for image sequence processing, has in fact, becoming more attainable. this research absolute Moment Block Truncation compression technique which is depend on adopting the good points of oth

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

      In this paper we shall prepare an  sacrificial solution for fuzzy differential algebraic equations of fractional order (FFDAEs) based on the Adomian decomposition method (ADM) which is proposed to solve (FFDAEs) . The blurriness will appear in the boundary conditions, to be fuzzy numbers. The solution of the proposed pattern of  equations is studied in the form of a convergent series with readily computable components. Several examples are resolved as  clarifications, the numerical outcomes are obvious that the followed approach is simple to perform and precise when utilized to (FFDAEs).

Some nonlinear differential equations with fractional order are evaluated using a novel approach, the Sumudu and Adomian Decomposition Technique (STADM). To get the results of the given model, the Sumudu transformation and iterative technique are employed. The suggested method has an advantage over alternative strategies in that it does not require additional resources or calculations. This approach works well, is easy to use, and yields good results. Besides, the solution graphs are plotted using MATLAB software. Also, the true solution of the fractional Newell-Whitehead equation is shown together with the approximate solutions of STADM. The results showed our approach is a great, reliable, and easy method to deal with specific problems

The process of combining the significant information from a series of images into a single image called image sharpening or image fusing, where the resultant fused image will be having more spatial and spectral information than any of the input images. in this research two images of the same place in different spatial resolution have been used the first one was panchromatic and the second image was multispectral with spatial resolution 0.5m and 2 m respectively. These images were captured by world view-2 sensor. This research resent four pan sharpening methods like (HSV, Brovey (color normalizes) , Gram shmidt and PCA)these methods were used to combine the adopted images to get multispectral image

A frequently used approach for denoising is the shrinkage of coefficients of the noisy signal representation in a transform domain. This paper proposes an algorithm based on hybrid transform (stationary wavelet transform proceeding by slantlet transform); The slantlet transform is applied to the approximation subband of the stationary wavelet transform. BlockShrink thresholding technique is applied to the hybrid transform coefficients. This technique can decide the optimal block size and thresholding for every wavelet subband by risk estimate (SURE). The proposed algorithm was executed by using MATLAB R2010aminimizing Stein’s unbiased with natural images contaminated by white Gaussian noise. Numerical results show that our algorithm co

Image quality plays a vital role in improving and assessing image compression performance. Image compression represents big image data to a new image with a smaller size suitable for storage and transmission. This paper aims to evaluate the implementation of the hybrid techniques-based tensor product mixed transform. Compression and quality metrics such as compression-ratio (CR), rate-distortion (RD), peak signal-to-noise ratio (PSNR), and Structural Content (SC) are utilized for evaluating the hybrid techniques. Then, a comparison between techniques is achieved according to these metrics to estimate the best technique. The main contribution is to improve the hybrid techniques. The proposed hybrid techniques are consisting of discrete wavel

Numeral recognition is considered an essential preliminary step for optical character recognition, document understanding, and others. Although several handwritten numeral recognition algorithms have been proposed so far, achieving adequate recognition accuracy and execution time remain challenging to date. In particular, recognition accuracy depends on the features extraction mechanism. As such, a fast and robust numeral recognition method is essential, which meets the desired accuracy by extracting the features efficiently while maintaining fast implementation time. Furthermore, to date most of the existing studies are focused on evaluating their methods based on clean environments, thus limiting understanding of their potential a