Undirected graphs and networks
Undirected graphs and networks
Undirected graphs and networks
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
158 General Mathematics<br />
11<br />
12<br />
13<br />
multiple ultiple choice<br />
The degree of the vertex, C, in this diagram is:<br />
A 3<br />
B 5<br />
C 2<br />
D 4<br />
E 6<br />
multiple ultiple choice<br />
If a connected graph has 6 vertices, the least number of edges it could have is:<br />
A 5 B 4 C 6 D 7 E 8<br />
multiple ultiple choice<br />
The graph at right consists of:<br />
A 8 edges <strong>and</strong> 6 vertices<br />
B 6 edges <strong>and</strong> 12 vertices<br />
C 10 edges <strong>and</strong> 6 vertices<br />
D 6 edges <strong>and</strong> 8 vertices<br />
E 12 edges <strong>and</strong> 6 vertices<br />
A<br />
E D<br />
B<br />
A<br />
C<br />
D<br />
F<br />
B<br />
C<br />
E
Change language