Identification of neighbours plays a major role of many protocols for wireless Adhoc networks and also the process of network paths in a network plays an important role. Wormhole attack is a major issue in networks. This type of attack causes the opponent to collects packets from one location and channels them to other location and retransmits them into the network. To avoid the problem of wormhole attack, so far we have several mechanisms like packet leashes for detecting against wormhole attack, a counter measure using directional antennas. Mobile Secure Neighbour Discovery Protocol performs a measure of security against wormhole attack by participating mobile nodes. In this paper we uses graph rigidity, Laman theorem for wormhole avoidance and forbidden graph for wormhole detection. By using these graphs we will provide a better solution to overcome the problem of wormhole attack in wireless Adhoc networks. © 2005 - 2013 JATIT & LLS. All rights reserved.