D1 terms

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

Clues

  • A closed path, in which you start and finish at same place (5)
  • A route which only visits each vertex once (4)
  • Can travel along each edge once but start and finish different places (4, 8)
  • Connected graph with no cycles where all vertices are connected (8, 4)
  • Critical analysis: total time an activity can be delayed from earliest start time without delaying the finish time (5, 5)
  • Graph in which all vertices are connected (9, 5)
  • Graph that connects vertices in one set to vertices in another set (9, 5)
  • In a eulerian graph, all the vertexs have an ..... degree (4)
  • Is traversable, can travel along each edge once and return to start (8)
  • The number of edges leaving a vertex (6)

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Networks, algorithms and problem solving resources »