Graceful labeling of a graph  with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to  inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex.  In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph ,  graph,  graph, jellyfish graph , Dragon graph , ki

A new method presented in this work to detect the existence of hidden

data as a secret message in images. This method must be applyied only on images which have the same visible properties (similar in perspective) where the human eyes cannot detect the difference between them.

This method is based on Image Quality Metrics (Structural Contents

Metric), which means the comparison between the original images and stego images, and determines the size ofthe hidden data. We applied the method to four different images, we detect by this method the hidden data and  find exactly the same size of the hidden data.

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

في العقود الملزمة للجانبين اذا لم ينفذ احد المتعاقدين التزامه تنفيذا كليا فانه يجوز للمتعاقد الاخر ان يطلب من المحكمة فسخ العقد فسخا كليا ، الا انه قد يقتصر عدم التنفيذ على جزء من التزامه فعندئذ يثار التساؤل الاتي: هل يمكن فسخ العقد فسخا جزئيا ؟ الملاحظ ان هنالك خلافا فقهيا وقضائيا كبيرا حول جواز الفسخ الجزئي ، فالبعض يجيز الحكم بالفسخ الجزئي ، والبعض الاخر لا يجيز الحكم بالفسخ الجزئي، وقد انتهينا الى القول بع

The aim of this paper is to introduce and study a new kind of graphs associated to an ideal of a commutative ring. Let â„› be a commutative ring with identity, and I(â„›) be the set of all non-trivial ideals of â„› with S I(â„›). The sum ideal graph associated to S, denoted by       Î¨(â„›, S), is the undirected graph with vertex set {A I(â„›): S⊂A+B, for some B I(â„›)} where two ideal vertices A and B are adjacent if and only if A B and S⊂A+B. In this paper we establish some of characterizations and results of this kind of graph with providing some examples.

This research aims to demonstrate the knowledge pillars of the product life cycle assessment technique and how to measure the cost according to this technique, and to clarify its role in reducing costs, improving product quality and optimizing the use of available resources, and a set of results has been reached, the most important of which are: The separation of environmental costs through the use of product life cycle assessment technique helps the Management in handling the increase of these costs, reducing the rates of environmental pollution and preserving resources, which contributes to achieving the sustainability of the product, and based on the results obtained, a set of recommendations were presented, the most important of which w

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

The aim of this paper is to employ the fractional shifted Legendre polynomials (FSLPs) in the matrix form to approximate the fractional derivatives and find the numerical solutions of the one-dimensional space-fractional bioheat equation (SFBHE). The Caputo formula was utilized to approximate the fractional derivative. The proposed methodology applied for two examples showed its usefulness and efficiency. The numerical results showed that the utilized technique is very efficacious with high accuracy and good convergence.

The Hartley transform generalizes to the fractional Hartley transform (FRHT) which gives various uses in different fields of image encryption. Unfortunately, the available literature of fractional Hartley transform is unable to provide its inversion theorem. So accordingly original function cannot retrieve directly, which restrict its applications. The intension of this paper is to propose inversion theorem of fractional Hartley transform to overcome this drawback. Moreover, some properties of fractional Hartley transform are discussed in this paper.

            Semi-parametric regression models have been studied in a variety of applications and scientific fields due to their high flexibility in dealing with data that has problems, as they are characterized by the ease of interpretation of the parameter part while retaining the flexibility of the non-parametric part. The response variable or explanatory variables can have outliers, and the OLS approach have the sensitivity to outliers. To address this issue, robust (resistance) methods were used, which are less sensitive in the presence of outlier values in the data. This study aims to estimate the partial regression model using the robust estimation method with the wavel