D1 Graph Definitions

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