Karteikarten
D1 AS Maths Edexcel Definitions
Karten in diesem Stapel (18)
- 1Treea connected graph with no cycles
- 2Spanning Tree (sub-graph)a sub-graph which includes all the nodes and edges of another graph
- 3Graphconsists of points (nodes) which are connected by lines (edges)
- 4Weighted Grapha graph which has a number associated with each edge
- 5Node (vertices)point on a graph
- 6Edgea line on a graph which connects two nodes
- 7Degree/Valency/Ordernumber of edges connected to 1 node
- 8Patha sequence of edges such that the end vertex of one edge is the beginning of another
(NO VERTEX APPEARS MORE THEN ONCE) - 9Walka path which you are permitted to return to more than once
- 10Cyclea closed path
- 11Digrapha graph where the edges have a direction (eg 5km)
- 12Isomorphicwhere, in multiple graphs, the nodes and edges are connected identically but the shape is different
- 13Bipartitea graph with 2 sets of vertices and the connections are between the two sets not within
- 14Complete Graphwhen every node is connected by two edges
- 15Even degreefor example- 2 edges connected to 1 node---- 2=even
- 16Loopsimilar to a cycle - starts and ends at the same node
- 17Sub-graphvertices and edge are subsets of another graph
- 18Simple Graphcontains no loops or multiple edges
Informationen
- Beschreibung
- Karteikarten am D1 AS Maths Edexcel Definitions, erstellt von Chloe Anderson am 12/12/2016.
- Erstellt von
- Chloe Anderson
- Aufrufe
- 34
- Tags
- Bewertung