Graph Theory

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

Clues

  • A cycle that visits all vertices (11, 5)
  • A graph that can be drawn without taking the pen from the paper and without going over an edge twice (11, 5)
  • A graph with directed edges (8, 5)
  • A simple connected graph with one fewer edge than total vertices (8, 4)
  • A trail using all the edges of a graph, for it to exist, the degree of each vertex must be even (8, 5)
  • Adds edges to a tree in order of size (8, 9)
  • Each edge must be walked along at least once, the least pairings of odd vertices must be walked along on one extra occasion. (7, 7, 5)
  • Enables the shortest path between two points to be found (9, 9)
  • Has two sets of vertices and the edges only connect vertices from one set to the other (9, 5)
  • N vertices with each vertex joined to each other vertex once (8, 5, 2)

Comments

No comments have yet been made

Similar Mathematics resources:

See all Mathematics resources »See all Graphs and transformations resources »