Flashcards in Decision Deck (20):

1

## Graph

### collection of vertices and edges

2

## Vertex/ node

### the dots in a graph (usually where 2 or more edges meet, but not necessarily)

3

## Edge/ arc

### a line between two vertices

4

## Tree

### a graph with no cyles

5

## Order (degree) of a vertex

### the umber of edges starting or finishing at that vertex

6

## Simple graph

### a graph with no loops or multiple edges

7

## A path

### a route starting and finishing at the same vertex

8

## A cycle

### a route starting and finishing at the same vertex

9

## Connected graph

### a graph in which there is a route from each vertex to any other vertex (i.e. the graph is in one part)

10

## Complete graph

### a simple graph in which every pair of vertices is connected by an edge

11

## Bipartite graph

### one in which the vertices are in two sets and each edge has a vertex from each set

12

## Planar graph

### one which can be drawn with no edges crossing

13

## Sub graph

### any set of edges & vertices taken from a graph is a sub graph

14

## Hamiltonian graph

### a cycle that visits every vertex of the graph

15

## Eulerian cycle

### a cycle that travels along every edge of the graph

16

## Eulerian graph

### a graph with all nodes even

17

## Di-graph

### a graph in which the edges indicate direction

18

## Incidence matrix

### a matrix representing the edges in a graph

19

## Semi-Eulerian graph

### a trail using all arcs once. Start and finish at different nodes. Exactly 2 odd nodes

20