Karteikarten
D1 maths definitions
Karten in diesem Stapel (19)
- 1The degree/valency/order of a vertexnumber of edges incident to it
- 2A weighted graphA graph that has a number associated with each edge (it’s weight)
- 3A graphA group of vertices (nodes) which are connected by edges
- 4A sub-graphPart of a graph
- 5A pathA sequence of edges. The end vertex of one edge is the start vertex of the next. Vertexes are not repeated
- 6A walkA path in which you are permitted to return to vertices more than once
- 7A cycleA closed path
- 8A loopAn edge that starts and finishes at the same vertex
- 9TreeA connected graph with no cycles
- 10A spanning treeA sub-graph which includes all vertices of the graph and is also a tree
- 11Bipartite graphTwo sets of vertices X and Y. The edges only join vertices in X to Y
- 12A simple graphA graph with no loops and not more than one edge connecting any pair of vertices
- 13Directed edgesThe edges of a graph have a direction associated with them
- 14DigraphEdges with direction in the graph
- 15A complete graphEvery vertex is directly connected by an edge to each of the other vertices
- 16A complete bipartite graphr vertices in set X and s vertices in set Y
- 17Isomorphic graphshows the same information but drawn differently from a graph
- 18An adjacency matrixRecords the number of direct links between vertices
- 19A distance matrixRecords the weights on the edges. When there is no weight, it is indicated by “-“
Informationen
- Beschreibung
- Feel free to use this - I find it helps me learn all of the definitions! Copied straight from the textbook so perfect answers. Edexcel D1 maths
- Erstellt von
- emilycompton1996 · Mär 2014
- Aktualisiert
- 8 Mär 2017
- Aufrufe
- 384
- Tags
- Bewertung