D1 Graph Definitions

HideShow resource information
• Created by: Tassillow
• Created on: 30-05-16 15:05
 E H P N S E S O T K U M E N H R J V G T Y F W P W R T P V F F E F W B B H I A Y K Q Q K W H B I J B I B N S S J Q D U O B N I Y J N G K T F W S B I P A R T I T E S S X K H J E D R F M O I I A H Q L R M J R D H M V O C C A K C M S Q N W I B E O B S D U E E C I Y P W O O W W N V Q M C A E I J E T H U R P I O M R J C I B B N T N W H F P S F N I F B U P P H P N D G D E G U M M D Q O D W U E G L H R I G G L L D U U J Y X G A E A X T L E I A H T I X M E V M T F V E E T C V E Q T C F Y R T M O C F X U M U B C H L F L N E N X E E R E V A D I P U M W A G H H P T I W C K E F O J U Q H B D A F T I S R M M O Y K K V N C E C J Q R P D X H E G G O G L X X C O N N E C T E D N Q P H W C L C U L E K J R F X W Q M C H A E N E J E C O N N E C T E D G R A P H X E O D L X E S E M I E U L E R I A N Q K H X B A S J C H O Y L Y K G R U V P B X S X X B F E W A G C L V W I O L U K R X P D U W S

Clues

• 2 sets of vertices X and Y, edges only join X node to Y node (9)
• 2 vertices with a path between them (9)
• A graph which has a trail that is not closed that contains every arc precisely once (4, 8)
• All vertices Connected (9, 5)
• Every node in X connected to every node in Y (8, 9)
• Graph showing same information but in different orientations (10)
• Graph where each edge has a value (8)
• Graph where edges have a direction (8)
• Graph with every node directly connected by an edge to every other node (8)
• Subgraph that contains all vertices of the graph and has no cycles (8, 4)