Graph Theory

Question 0

Degree/order

Answer 0

The number of edges a vertex is connected to

Question 1

Simple graph

Answer 1

A graph that has no loops

It also has at most one edge between each pair of vertices

Question 2

Directed graph/digraph

Answer 2

A graph who’s edges have a direction

Question 3

Complete graph

Answer 3

A graph where every vertexes connected to every other vertex

Question 4

Formula for total number of edges in a complete graph

Answer 4

n(n-1)/2

Question 5

Trail

Answer 5

A journey along the edges of a graph, with no edge included more than once

Question 6

Path

Answer 6

A trail where no vertex is visited more than once (except for the starting vertex)

Question 7

Cycle

Answer 7

A closed path with at least one edge

Question 8

Hamiltonian cycle

Answer 8

A cycle that visits every vertex

Question 9

Eulerian trail

Answer 9

A trail that includes every edge

Question 10

Eulerian graph

Answer 10

A graph that possesses a closed Eulerian trail

Question 11

Semi-Eulerian

Answer 11

A graph that possesses a non-closed trail that uses all its edges

Question 12

Traversable

Answer 12

A graph that can be drawn without lifting your pen off the page

Question 13

Formula for the maximum number of Hamiltonian cycles in a graph with n nodes

Answer 13

(n-1)!/2

Question 14

Formula for the maximum number of Hamiltonian cycles in a Diagraph with n nodes

Answer 14

(n-1)!