*
**
In this paper we introduce evidence labelling for fuzzification of crisp graphs. In evidence labelling, the vertex labelling is done by an injective function m and the edge labelling is done by the injective function ρ. The evidently labelled graph is a fuzzy graph. We also prove some theorems which show the admissibility of evidence labelling in path related graphs.
Evidence Labelling, Path graph, Middle graph, strong duplicate graph, shadow graph, Z-graph
