Application of Soft Sets to Determine Hamilton Cycles in a Graph

Traditionally graphs can be represented by pictures, relations or matrices. Now a new technique is available to represent graphs with the help of soft sets. Cycles, Euler cycles and Hamilton cycles are very important concepts in graph theory due to their various applications. In this paper it is shown that soft sets are very handy to determine the presence of Euler s cycle and Hamilton s cycle in a graph.