Terminology

Question 1

Vertex

Answer 1

Points in a graph

Question 2

Edge

Answer 2

Connects two vertices together

Question 3

Degree

Answer 3

Number of lines that go into a vertex

Question 4

Connected

Answer 4

A graph where you can go from vertex to any other vertex

Question 5

Loop

Answer 5

Starts at a vertex and ends at the same vertex

Question 6

Multiple edges

Answer 6

More than one edge going from vertex to another

Question 7

Simple graph

Answer 7

Graph with no multiple edges or loops

Question 8

Regular graph

Answer 8

Every vertex has same edges

Degree equal at every vertex

Question 9

Tree

Answer 9

Connected with no circuit

Question 10

Isomorphic graph

Answer 10

Two graphs that look different but are identical - Move points around.

Question 11

How to check if a graph is isomorphic

Answer 11

Check if the degrees match

Question 12

Walk

Answer 12

Go from one point to another

Question 13

Path

Answer 13

Walk but can’t travel on edge twice

Question 14

Chain

Answer 14

Path in which you can’t move over vertex and edge twice

Question 15

Closed path/Circuit

Answer 15

Starts and ends at same point

Question 16

Hamiltonian circuit

Answer 16

Travels every single vertex and ends at the same point

Question 17

Eulerian path

Answer 17

Path that goes through every edge once

Question 18

Eluerian circuit

Answer 18

Eulerian path that starts and ends at the same point

Question 19

How to figure out if a graph is a Eulerian path

Answer 19

Work out degree
More than two odd vertices - Impossible
If two - Start at one odd end and end at the other

Question 20

How to find a Eulerian circuit

Answer 20

All vertices must have an even number of degrees.