Fichas
D1 Graph/ Network Rules
Fichas del conjunto (18)
- 1Total OrderNumber of arcs x2
- 2Total order = odd or evenEven
- 3How many odd nodes should there be on any one graph?An even number
- 4Rule for number of arcs on a treeN-1
- 5Max order of any vertex on a simple graph?N-1
- 6Connected GraphIt is possible to get from any vertex to any other vertex directly or indirectly
- 7Simple GraphNever more than one arc joining a pair of vertex & no loops
- 8Simply connectedBoth Simple & Connected
- 9Planar GraphNo arcs cross over each other ( meaning it can be drawn on a 2D diagram )
- 10TrailSequence of arcs is where the end vertex or one arc is the start of another
(Connects vertex together) - 11PathA trial where no arc can pass through a a vertex more than once
- 12What is a dot on the graph called ?A node or a Vertex
- 13Closed TrailStart and finish at the same vertex (start and finish vertex are the same)
- 14CycleONLY the start and finish nodes are the same
- 15TreeConnected graph with no cycles
- 16Eulerian GraphConnected graph with closed trail that contains every arc once and only once. = Even numberorder
- 17Semi-EulerianConnected but without a closed trail, every arc is once and only once. = 2x odd nodes
- 18NetworkEvery arc has a numerical value called its weight
Información
- Descripción
- Fichas sobre D1 Graph/ Network Rules, creado por alinam el 23/03/2015.
- Creado por
- alinam
- Visitas
- 41
- Etiquetas
- Valoración