Davidson Missouri W/Graphs
From 2007.igem.org
(Difference between revisions)
Ashoecraft (Talk | contribs) |
Ashoecraft (Talk | contribs) |
||
| Line 4: | Line 4: | ||
Hamiltonian Path (HP) - 1 12 42 23 36 65 | Hamiltonian Path (HP) - 1 12 42 23 36 65 | ||
| - | + | ||
The following graph is another subgraph of Adedlmans graph with 7 edges/5 nodes but with terminator at 7 instead of 5. | The following graph is another subgraph of Adedlmans graph with 7 edges/5 nodes but with terminator at 7 instead of 5. | ||
Revision as of 17:35, 9 July 2007
We have been developing different number of edges/node graphs that can be used to build as practice to eventually make our 12 edge/7 node graph. We have generated a table also that will include all the graphs that we have and will develop along with characteristics about each graph. The characteristic include number of Hamiltonian Paths, number of true positives, number of false positives, number of total arrangements, easiest number of flips, medium number of flips and hard number of flips.
The following graph is a subgraph of Adelman's graph with 9 edges/6. Hamiltonian Path (HP) - 1 12 42 23 36 65
The following graph is another subgraph of Adedlmans graph with 7 edges/5 nodes but with terminator at 7 instead of 5. HP-1 12 23 34 47
