definitions

Question 1

Isomorphic

Answer 1

1 to 1 correspondence between vertices which preserves adjacency

Question 2

Subgraph

Answer 2

A graph whose edges and vertices are contained within the original graph

Question 3

Walk

Answer 3

Sequence of connected edges in a given graph

Question 4

Trail

Answer 4

A walk in which no edge is listed more than once

Question 5

Path

Answer 5

A walk in which no vertex is listed more than once

Question 6

Cycle

Answer 6

A path that finishes where it started

Question 7

Connected graph

Answer 7

A graph where there is a path between any pair of vertices

Question 8

Simple graph

Answer 8

Graph with no loops or no repeated edges

Question 9

Tree

Answer 9

Connected graph with no cycles

Question 10

Eulerian graph

Answer 10

Connected graph with no odd vertices

Question 11

Eulerian cycle

Answer 11

A cycle within an Eulerian graph that includes every edge EXACTLY ONCE

Question 12

Semi-Eulerian graph

Answer 12

Connected graph with EXACTLY TWO odd vertices

Question 13

Hamiltonian cycle

Answer 13

A cycle that passes through every vertex EXACTLY ONCE

Question 14

Hamiltonian graph

Answer 14

A graph which contains a Hamiltonian cycle

Question 15

Planar graph

Answer 15

Graph where edges do not intersect except at vertices