D1 graph definitions

Definitions of key terms from D1 maths, edexcel.

?
  • Created by: Charlotte
  • Created on: 04-04-13 10:24
Q C H V X X W O G W T A C F Q T C F U U H
C O D M S I O M H H D E N A H V R P E J P
O M P Q S R S E X P O H J R P A Y A L D L
N P R B N T P E L A O T F L A L I F C X Q
N L P H H A E R O R M K D K R E C U Y V P
E E F P N M T T B G O B X O G N Y N C W O
C T X A X E T G N N Y A I C E C O P N L J
T E R R K C B N H A M P T C T Y F K A C L
E M K G T N B I P I V U U Y E D R F I K K
D A A E S E S N A R U R U U L E L T R G H
G T T T X D I N R E V V I A P G J V E G U
R C B I Q I Q A G L X D D M M R F Q L G N
A H G T H C J P R U Q I A G O E T F U I E
P I L R G N D S A E J S M F C E C V E R F
H N L A M I W L N I E B C B R O T F F H P
K G S P B Q O I N M P V M A D R P X Q P W
C R Y I F X C G A E N O F C P D G T G L D
T H Y B E G E N L S G T R D E E S Y D F A
E H R C J E T Q P P S Q F V N R R D A P Y
N S Y L F I L M S T C M P F G P F S B R V
M P L L J H R D S S I O W W G A R T K C L

Clues

  • A cycle in which every node of the graph is visited only once. A ........ graph cannot have any odd arcs. (8, 5)
  • A subgraph of a graph, G, which includes all the nodes of G and is also a tree. (8, 4)
  • All its nodes have paths between them (are connected). (9, 5)
  • Every member of X is paired with a member of Y of the matching. (8, 8)
  • Every vertex is connected to every other vertex (8, 5)
  • Has exactly two odd vertices (4, 8, 5)
  • Matrix of connections that can be drawn up to illistrate a graph. Non digraph matrices will be symmetrical. (9, 6)
  • The graph can be drawn without crossing any arcs (7, 5)
  • The number of arcs incident to the nodes. A node is odd ( even ) if it has odd ( even ) degree. (7, 11)
  • Two sets of nodes X and Y. The arcs only join nodes in X to nodes in Y, not nodes within a set. (9, 5)

Comments

No comments have yet been made

Similar Mathematics resources:

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