**Unformatted text preview: **defaewgﬁa 3 {Q U32. ”L 1&0 557 Let G be a graph.
The next three questions refer to A winch is an adjacency matrix for G. 0 1 1 2 0
1 0 0 O l
A m 1 O 0 1 1
2 O 1 0 O
{J 1 l 0 0
17. The degree Sequence of G is
@(2,2,3,3,4). (b) (o,1,1,2,0). (o) (0,0,1,1,2).
(d) (2., 3, 4). (e) none of the above.
18. The size of the graph G is
(a) 2. (b) 3. @ 7. (d) none of the above. 19. The entry at position (4, 2) in the matrix A2 ie .2. (b) 1. (o) 0. (d) 4. (e) none of the above. 20. Let H be the plane drawing of the planar graph G, drawn above. The graph H has (a) 10 faces. (b) 5 faces. (o) 11 faoes.
(d) 6 faces. none of the above.
dun. M 7 ﬂaw The next two questions refer to the graph H drawn below: HA 1: 21. The size of H *, the dual of H is
(a) 4. (b) 3. ® 6. (d) none of the above. 22. The order of H * is (a) 4. .3. (e) 6. (d) none of the above. 23. if G is a connected plane graph of order '0, size e and with f faces, then .ome+f:2. (b)e——o+f=2.
(o)n+e-~—f=2. (d)e+omfm2. (e) none of the above. ...

View
Full Document

- One '14
- Graph Theory