Flashcards in D1 Deck (18):

1

## Graph

### Diagram involving a set of points and interconnecting lines

2

## Vertex

### A point on a graph

3

## Edge

### A connecting line on a graph between two points

4

## Loop

### Line connecting a vertex to itself

5

## Multiple edges

### Two edges connecting two points

6

## Simple graph

### No loops or multiple edges

7

## Connected

### Possible to travel from any vertex to any other vertex (you can go via other vertices)

8

## Degree

### The no. edges arriving at a vertex

9

## Complete graph

### There is an edge connecting every possible pair of vertices

10

## Kn is the complete graph with n vertices. How many edges does it have?

### 1/2n(n-1)

11

## What does an adjacency matrix show?

### the number of direct routes from one vertex to another

12

## Network

### Graph where each edge has an associated number it's 'weight'

13

## What does a distance matrix show?

### the weights of the routes between one vertex to another

14

## Walk

### sequence of connected edges

15

## Trail

### Walk where you can't use any edge more than once

16

## Closed trail

### Trail that returns to the starting vertex

17

## Path

### Trail that doesn't revisit any vertices

18