D1 Definitions You Need To Know

D1 definitions that you need to know!

Well the top ten since it won't let me make more than ten somehow!!!

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

Clues

  • A closed path. (5)
  • A connected graph with no cycles. (4)
  • A finite sequence of edges, such that the end vertex of one edge is the start of the next, and no vertex appears more than once. (4)
  • A graph in which every vertex is directly connected by an edge to each of the other vertices. (8, 5)
  • A graph that consists of 2 sets of vertices, X and Y. The edges ONLY join vertices in X to those in Y. (9, 5)
  • A path where you can return to vertices more than once. (4)
  • A spanning tree such that the total length of its arcs (edges) is as small as possible. (7, 8, 4)
  • A subgraph which includes all the vertices of the original graph and is also a tree. (8, 4)
  • Graphs that show the same information but are drawn differently. (10, 6)
  • The number of edges incident to a vertex. (18)

Comments

No comments have yet been made

Similar Mathematics resources:

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