Three dimensional DNA graph structure solution to edge-connectivity

To determine the edge connectivity of a graph,a three dimensional DNA graph structure and the detailed procedures of the algorithm are presented in this paper.Based on k armed branch DNA molecule,a corresponding DNA graph structure can be constructed successfully.Processed by some specific restriction endonucleased and analyzed by gel electrophoresis,the edge connectivity of the graph can be determined.By discussing the feasibility of this algorithm,it is suggested that this sort of structure can convey a graph directly and the algorithm can solve some intractable problems more easily and effectively.