D1 Word Scramble
|
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.
Normal Size Small Size show me how
Normal Size Small Size show me how
Term | Definition |
Connected Graph | Each vertices is connected to an edge |
Order of a node | The number of edges attached to a vertices |
Simple Graph | No loops or multiple edges joining 2 vertices |
Tree | A simple graph with no cycles |
Complete graph | Every vertice is joined to every other vertice n(n-1)/2 |
Eulerian | A connected graph with a single closed trail |
Trail | No edge repeated |
Quadratic complexity | time=k*order^2 |
Minimum connector | n=vertices n-1=arcs |
Created by:
teandkate
Popular Math sets