A survivable path between a pair of vertices in an undirected simple graph is an ordered pair of edge-disjoint simple paths consisting of a working path a protection path .An optimal set of survivable paths in graph corresponds to a set of mesh-restored lightpaths defined on an optical network that minimizes the number of used optical channels.In this paper, we present new properties of the working paths, which are contained in an optimal set of survivable paths in .