2343808
| Frage | Antworten |
| Total Order | Number of arcs x2 |
| Total order = odd or even | Even |
| How many odd nodes should there be on any one graph? | An even number |
| Rule for number of arcs on a tree | N-1 |
| Max order of any vertex on a simple graph? | N-1 |
| Connected Graph | It is possible to get from any vertex to any other vertex directly or indirectly |
| Simple Graph | Never more than one arc joining a pair of vertex & no loops |
| Simply connected | Both Simple & Connected |
| Planar Graph | No arcs cross over each other ( meaning it can be drawn on a 2D diagram ) |
| Trail | Sequence of arcs is where the end vertex or one arc is the start of another (Connects vertex together) |
| Path | A trial where no arc can pass through a a vertex more than once |
| What is a dot on the graph called ? | A node or a Vertex |
| Closed Trail | Start and finish at the same vertex (start and finish vertex are the same) |
| Cycle | ONLY the start and finish nodes are the same |
| Tree | Connected graph with no cycles |
| Eulerian Graph | Connected graph with closed trail that contains every arc once and only once. = Even numberorder |
| Semi-Eulerian | Connected but without a closed trail, every arc is once and only once. = 2x odd nodes |
| Network | Every arc has a numerical value called its weight |
Möchten Sie mit GoConqr kostenlos Ihre eigenen Karteikarten erstellen? Mehr erfahren.