Decision Graph Definitions

?
J Q F K A Y S Q M V D Y L M S Q L J M R S
F I Y H B M M Q B F V M K H V X R T E U R
C V C U P H S K E U G U P M H W X N L E U
D C U U I F R U C E H A A P D H X S C W T
Q I G H J P Q O T L R A A W P I S G Y C R
T M H Y E X Y O J G U R H A R F C T C Q N
U M O E P Y S H E V G P R T M X F E N M X
J T J R N C B T E D A G A C F F C S O H F
Y A J T H X I R E R R M G O W W I E T W G
H I V I R T T T G A E H B M M K H T L T R
K O Q K R E C E N C C M E P X R P E I K O
U G U A X E L A N G W L B L G J R R M D Y
D H P N N P L E W L P N R E O V O C A D V
V I O N M P D K M C W E W T R E M S H E V
B D O I V I J E E A S N H E R R O I P B Y
E C S N C M K X U X N I Q G B G S D H O A
G J S N R B E D C G X J J R E V I V I M U
B P I Y N O Q O H J U F T A M L H G A X P
B V S G B E I O A G A I S P P I H S R P K
S R S M I H A I I P Y E B H B W G R Y N R
V W P X Y M R I B U D E Y F J G B E E P R

Clues

  • A cycle which visits every vertex. Each vertex is visited once and only once. (8, 5)
  • A graph in which tehre are no loops and in which there is no more than one arc connecting any pair of vertices. (6, 5)
  • A graph which can be drawn with any arcs crossing (6, 5)
  • A point on a graph that is connected to other vertices by arcs. (6, 4)
  • A set which can be counted (8, 3)
  • A way of representing a graph on a matrix. (9, 6)
  • simple graph in which every pair of vertices is connected by an edge. (8, 5)
  • Two graphs are isomorphic if one can be stretched, twisted or otherwise distorted into the other (10)
  • Vertices fall into two sets and each edge has a vertex with one set at one end and the other set at the other end. (9, 5)
  • Where a path exists between every pair of vertices. (9, 5)

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Decisions Graphs resources »