Decision

Question 1

Loop

Answer 1

An edge that starts and ends at the same vertex

Question 2

Order(degree)

Answer 2

Number of edges at a vertex(can be odd or even)

Question 3

Simple

Answer 3

Has a maximum of one edge between each between each pair of vertices and no loops

Question 4

Graph

Answer 4

A set of vertices and edges

Question 5

Path

Answer 5

Is a walk where no vertex is visited more than once

Question 6

Walk

Answer 6

Is a route along edges of a graph from one vertex to the next

Question 7

Trail

Answer 7

Is a walk where no edge is visited twice

Question 8

Cycle

Answer 8

Is a walk with the same end and start vertex without visiting any other vertex more than once

Question 9

Hamiltonian cycle

Answer 9

Cycle that goes through each vertex exactly once before returning

Question 10

Connected

Answer 10

Joined up has a trail or path between any two vertices in the graph

Question 11

Eulerian

Answer 11

Can be drawn without taking the pen off the page starting and finishing at the same vertex (all vertices have even order)

Question 12

Semi-emulation

Answer 12

Can be drawn without taking pen off page starting and finishing at different vertices( exactly two vertices have odd order)

Question 13

Subgraph

Answer 13

A graph that is part of another graph

Question 14

Subtree

Answer 14

A subgraph that is a tree

Question 15

Spanning tree

Answer 15

A subtree that contains all vertices of the original graph

Question 16

Minimum spanning tree

Answer 16

Minimum connector a spanning tree that has a minimum possibility (total weight)
A connected subgraph with no cycles and the minimum total weight ( simple