8ev uaLe: 01-03-14

Data Structures & A|gor|thms

MCD002641

ur. lan van der Llnde
1utor|a| 11: Craph 8epresenLaLlon


1o be compleLed wlLh LecLure 11 slldes avallable for reference

1. uraw sLandard graphs k
S
, C
S
, and W
S
ln a clrcular formaL, labelllng Lhe verLlces from Lop Lo
boLLom, lefL Lo rlghL.

2. Show (a) seLs (V and L), (b) ad[acency ||st, (c) ad[acency matr|x, and, (d) |nc|dence matr|x for
each of Lhe Lhree graphs you drew, above.

3. SLaLe Lhe s|ze and order of each of Lhe Lhree graphs (noLe LhaL graph order ls Lhe number of
vert|ces, and graph slze ls Lhe number of edges).

4. uraw Lhe resulLanL graph lf we perform Lhe seL LheoreLlc operaLlon k
S
- C
S
, and provlde lLs
ad[acency maLrlx. noLe LhaL we wlll only be subLracLlng edges ln Lhls operaLlon.

S. Are Lhe Lwo graphs shown below |somorph|c? lf so, whaL ls Lhelr verLex mapplng?


6. 8rlefly sLaLe Lhe dlfferences beLween welghLed and unwelghLed graphs, and sLaLe one posslble
use of each graph Lype.

7. (a) annoLaLe Lhe graph shown below, G, Lo show Lhe degree of each verLex and (b) conflrm Lhe
Lheorem LhaL !"#$%&'(&# *%+,-. +/0+1. -+2& +" &2&" "!34&% 56 2&%($'&. 0$(- 5## #&*%&&7.


8ev uaLe: 01-03-14


8. 8rlefly sLaLe Lhe dlfference beLween a s|mp|e graph, a mu|t|graph and a hypergraph.

9. Show Lhe ad[acency maLrlx for Lhe complemenL of G, above, and draw Lhe resulLanL graph, G
c
.

10. ls Lhe G
c
a slmple, mulLl- or hypergraph?

11. ls G a planar graph (l.e., a graph LhaL can be drawn wlLhouL any edges crosslng)?

12. Show an example of a 3-verLex sub-graph of graph G.

13. ln reference Lo graph G, (a) llsL all cuL verLlces, (b) llsL all cuL edges.

14. ls lL posslble Lo creaLe two dlsconnecLed graphs of equal order from G, above by ellmlnaLlng a
subseL of verLlces?

1S. uraw an example of a 6-verLex weakly connecLed dlgraph wlLh 2 knoLs.

16. uraw an example of a 6-verLex sLrongly connecLed dlgraph.

17. ls graph G blparLlLe?

18. LlsL Lhe sequence of verLlces vlslLed durlng a wa|k of graph G, above, of lengLh 4. ls Lhe walk
you have plcked a s|mp|e path? ls lL a s|mp|e tra||? ls Lhe walk c|osed or open?

19. Can we produce (a) a Lu|er|an path, and (b) a Lu|er|an c|rcu|t uslng graph G?

20. Can we produce (a) a PamllLonlan paLh, and (b) a PamllLonlan clrculL uslng graph G?

keferences

Craphs are dlscussed ln SecLlon vl (Craph AlgorlLhms), ChapLers 22-26, of Lhe recommended
LexLbook, Cormen &( +/. (2009). Several excellenL lhone apps exlsL LhaL demonsLraLe graph
represenLaLlon and graph algorlLhms, lncludlng Craph 1heory", Convex Pull" (a demonsLraLlon
of an lnLeresLlng graph LheoreLlc problem), and Craphlng".

Ldsger ul[ksLra's orlglnal SA arLlcle ls provlded ln Lhe Pomework 8eadlng 11" folder wlLh Lhls
week's noLes: ul[ksLra, L. W. (1939). 8 95(& 5" :05 ;%54/&3. $" <5""&=$5" 0$(- >%+,-.,
9!3&%$.'-& ?+(-&3+($@ 1: 269-271. dol: 10.1007/8l01386390.