Davidson Missouri W/Graphs
From 2007.igem.org
(Difference between revisions)
Ashoecraft (Talk | contribs) |
Ashoecraft (Talk | contribs) |
||
| Line 1: | Line 1: | ||
| - | 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 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. | ||
[[Image:Adelman9edges6node.jpg|400px]] | [[Image:Adelman9edges6node.jpg|400px]] | ||
Revision as of 16:42, 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.
