Flashcards in Graphs Deck (19):

1

## vertices/ nodes

### a point on a graph where edges join

2

## edges/ arcs

### a line connecting nodes

3

## loops

### an edge connecting a node to itself

4

## multiple edges

### two or more edges connecting the same two nodes

5

## simple graphs

### graphs without loops or multiple edges

6

## subgraphs

### graphs that can be contained within another graph

7

## complete graphs

### graphs where every node is connected to every other node

8

## bipartite graphs

### graphs where the nodes in a set are connected to nodes in another set but do not connect to nodes within the same set

9

## complete bipartite graphs

### graphs where every node in a set is connected to every node in another set

10

## trails

### sequences of nodes connected by edges

11

## paths

### trails where each node is visited only once

12

## closed trails

### trails where the start and end node are the same

13

## cycles

### closed trails where every node (except the start and end node) is only visited once

14

## order of vertices

### the number of edges meeting at a node

15

## connected graphs

### graphs where a path can be found to connect any two vertices (can go through other nodes to do this)

16

## Eulerian graphs

### connected graphs with a closed trail connecting every edge once with the same start/ end node

17

## semi-Eulerian graphs

### connected graphs where two nodes have off order so each edge can be travelled over only once as long as the start/ end nodes are different

18

## tree graphs

### connected graphs with no cycles

19