In this work, some mechanical properties of the polymer coating were improved by preparing a hybrid system containing Graphene (GR) of different weight percentages (0.25, 0.5, 1, and 2wt%) with 5wt% carbon fibres (CF) and added to a polymer coating by using casting method. The properties were improved as GR was added with further improvement on adding 5wt% of CF. The impact strength of acrylic polymer with GR increases with increasing weight ratio‏‏ of GR; maximum value was obtained when the polymer coating was incorporated with 1wt% GR and 5wt% CF. The impact strength of acrylic polymer with GR and GR/CF composites incorporated with GR at 1wt% and CF at 5wt%. Hardness increase with increasing weight ratio of Gr and a significant imp

Cryptography is a method used to mask text based on any encryption method, and the authorized user only can decrypt and read this message. An intruder tried to attack in many manners to access the communication channel, like impersonating, non-repudiation, denial of services, modification of data, threatening confidentiality and breaking availability of services. The high electronic communications between people need to ensure that transactions remain confidential. Cryptography methods give the best solution to this problem. This paper proposed a new cryptography method based on Arabic words; this method is done based on two steps. Where the first step is binary encoding generation used t

Making the data secure is more and more concerned in the communication era. This research is an attempt to make a more secured information message by using both encryption and steganography. The encryption phase is done with dynamic DNA complementary rules while DNA addition rules are done with secret key where both are based on the canny edge detection point of the cover image. The hiding phase is done after dividing the cover image into 8 blocks, the blocks that are used for hiding selected in reverse order exception the edge points. The experiments result shows that the method is reliable with high value in PSNR

     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

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

Attacking a transferred data over a network is frequently happened millions time a day. To address this problem, a secure scheme is proposed which is securing a transferred data over a network. The proposed scheme uses two techniques to guarantee a secure transferring for a message. The message is encrypted as a first step, and then it is hided in a video cover.  The proposed encrypting technique is RC4 stream cipher algorithm in order to increase the message's confidentiality, as well as improving the least significant bit embedding algorithm (LSB) by adding an additional layer of security. The improvement of the LSB method comes by replacing the adopted sequential selection by a random selection manner of the frames and the pixels wit

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

The local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &