Graphs

Question 1

vertices/ nodes

Answer 1

a point on a graph where edges join

Question 2

edges/ arcs

Answer 2

a line connecting nodes

Question 3

loops

Answer 3

an edge connecting a node to itself

Question 4

multiple edges

Answer 4

two or more edges connecting the same two nodes

Question 5

simple graphs

Answer 5

graphs without loops or multiple edges

Question 6

subgraphs

Answer 6

graphs that can be contained within another graph

Question 7

complete graphs

Answer 7

graphs where every node is connected to every other node

Question 8

bipartite graphs

Answer 8

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

Question 9

complete bipartite graphs

Answer 9

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

Question 10

trails

Answer 10

sequences of nodes connected by edges

Question 11

paths

Answer 11

trails where each node is visited only once

Question 12

closed trails

Answer 12

trails where the start and end node are the same

Question 13

cycles

Answer 13

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

Question 14

order of vertices

Answer 14

the number of edges meeting at a node

Question 15

connected graphs

Answer 15

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

Question 16

Eulerian graphs

Answer 16

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

Question 17

semi-Eulerian graphs

Answer 17

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

Question 18

tree graphs

Answer 18

connected graphs with no cycles

Question 19

planar graphs

Answer 19

graphs that can be drawn so that edges only meet at nodes (edges don’t cross when it is drawn out on paper)