D1 Graph Definitions

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

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 connected graph which has a closed trail containing every arc precisely once (8)
  • 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 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)

Comments

No comments have yet been made

Similar Mathematics resources:

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