Hamming distance is a metric used to compare two binary data strings of equal length, where binary string is a sequence of bytes which is used to store data in computers. It isthe number of bit positions in which the two binary strings differ. The hamming distance between two binary strings of equal length m and n is denoted by hd(m, n). The concept of hamming distance labeling was introduced by us and it has been proved that some path related graphs are hamming distance labeled graphs. Hamming distance labelingis used for transmitting secret messages in cryptography. In this paper, the existence of hamming distance labeling of twig, star, bistar and m- corona of path graph are verified and their hamming distance number are obtained.