Term
|
Definition
| A graph where every vertex is connected to every other vertex |
|
|
Term
|
Definition
| A route in which no vertex is repeated |
|
|
Term
|
Definition
| A route in which every vertex is visited exactly once and returns to the starting vertex - The vertices in these graphs can represent locations |
|
|
Term
|
Definition
| A line between two vertices - These can represent an activity or road between two places |
|
|
Term
|
Definition
| A path in which you are allowed to return to vertices more than once |
|
|
Term
|
Definition
| A subgraph which includes all vertices and is also a tree |
|
|
Term
|
Definition
| A route starting and finishing at the same vertex |
|
|
Term
|
Definition
| A graph with no loops and no more than one edge between any pair of vertices |
|
|
Term
|
Definition
| A connected graph where all the vertices have an even valency order |
|
|
Term
|
Definition
| A connected graph where all the vertices (except for 2) have an even valency order |
|
|
Term
|
Definition
| An edge starting and finishing at the same vertex |
|
|
Term
|
Definition
| The dots in a graph - These can represent places or starts and finishes of activities |
|
|
Term
|
Definition
| Records the weight on the edges of a graph |
|
|
Term
|
Definition
| A graph that can be drawn without any edges crossing |
|
|
Term
|
Definition
| Consists of two sets of vertices. The edges only join vertices between groups, not vertices within a set - These can be used to represent a matching |
|
|
Term
|
Definition
| A part / subsection / portion of a graph |
|
|
Term
|
Definition
| A graph in which a route can be found between any pair of verticies |
|
|
Term
|
Definition
| This is a real world value assigned to an edge |
|
|
Term
|
Definition
| A graph in which at least one edge has a direction associated with it (there can be two directions on edges as well) - These are often used to represent activity plans |
|
|
Term
|
Definition
| Records the number of direct links between vertices |
|
|
Term
|
Definition
| A collection of vertices and edges - These can be used to represent a map or an activity plan |
|
|
Term
| Order / Degree of a vertex (valency) |
|
Definition
| The number of edges starting or finishing at the vertex (number of edges attached to vertex) |
|
|
Term
|
Definition
| A graph that has no cycles |
|
|
Term
|
Definition
| Graphs that show the same information but are drawn differently - Such as tube maps |
|
|
Term
|
Definition
| This is a graph with weights assigned to each edge - Can represent any network with distances or any form of value associated with each edge |
|
|
