Fichas
D1 Graphs
Fichas del conjunto (24)
- 1order of a node is..?number of arc ends that meet at that node (draw circle)
- 2what is the total order of a graph?twice the number of arcs
- 3so..?the total order is always EVEN
- 4what can there never be?an odd number of odd nodes
- 5what must order of each node be in connected graph?at least 1
- 6in a simple graph, n nodes, what must the order of each node be?at MOST n-1
- 7why?every node can only be connected once to another n-1
- 8Eulerian graph is?all nodes even and connected. You can start and finish at the same node, going down each arc only once
- 9Semi - Eulerian graph is?connected and has EXACTLY 2 ODD nodes
- 10a tree?connected graph with no cycles
- 11complete graph?simply connected, each node is DIRECTLY connected to every other node.
- 12complete graph with n nodes is denoted..?
- 13isomorphic graph?a graph that is mathematically the same as another i.e. can redraw without adding or removing arcs or vertices
- 14bipartite graph?consists of 2 sets of nodes X and Y with arcs that only connect to the other set, not their own set
- 15planar graph?can be redrawn so that no arcs cross over eachother
- 16directed graph? (digraph)has one way flows indicated by arrows on the arcs
- 17a tree connecting n nodes will have exactly how many arcs?n-1 arcs
- 18completed graph (Kn) with n nodes (all of which have order n-1) will have how many arcs?1/2n(n-1) arcs
- 19explain a trail?the end node of one arc is the start node of the next - represents any route throughout the graph
- 20explain a path?a trail which doesn't repeat nodes
- 21explain a closed trail?the start and finish nodes are the same. repetitions of nodes are allowed
- 22explain a cycle?a closed trail where only the start and finish nodes are the same (so no repetitions allowed)
- 23connected graph?possible to get from any node to any other node, directly or indirectly
- 24simple graph?never more than one arc joining a pair of nodes, and no loops to join one node to itself
Información
- Descripción
- A level (D1) Maths Fichas sobre D1 Graphs, creado por Maisie Carroll el 15/03/2017.
- Creado por
- Maisie Carroll
- Visitas
- 0
- Valoración