中南大学《离散数学》课件-第6章（英文版）.pdf

Graphs

Agenda

pConcepts

pRepresentationandOperations

pSpecialgraphs

pIsomorphismandHomomorphism

pDijkstra’sAlgorithms

Copyright2007@byXuDezhi2

IntroductiontoGraphs

pDefinition:AsimplegraphG(V,E)

consistsofV,anonemptysetofvertices,

andE,asetofunorderedpairsof

distinctelementsofVcallededges.

pSometimeswewanttomodelmultiple

connectionsbetweenvertices,whichis

impossibleusingsimplegraphs.Inthese

cases,wehavetousemultigraphs.

Copyright2007@byXuDezhi3

Graphrepresentation/model

pExampleI:railwaysconnectingasetof

cities

pWeshoulduseasimplegraphwithanedge

{a,b}indicatingadirecttrainconnection

betweencitiesaandb.

pV{Changsha,Ninxiang,Xiangtan,Liuyang}

pE{{Changsha,Ninxiang},{Changsha,

Xiangtan},{Changsha,Liuyang}}

Copyright2007@byXuDezhi4

Graphrepresentation/model

pExampleI:railwaysconnectingasetofcities

pWeshoulduseasimplegraphwithanedge{a,b}

indicatingadirecttrainconnectionbetweencitiesaand

b.

pV{Changsha,Ninxiang,Xiangtan,Liuyang}

pE{{Changsha,Ninxiang},{Changsha,Xiangtan},{Changsha,

Liuyang}}

Copyright2007@byXuDezhi5

IntroductiontoGraphs

pDefinition:AmultigraphG(V,E)consistsofa

setVofvertices,asetEofedges,anda

functionffromEto{{u,v}|u,vV,uv}.

pTheedgeseandearecalledmultipleor

12

paralleledgesiff(e)f(e).

12

pNote:

pEdgesinmultigraphsarenotnecessarily

definedaspairs,butcanbeofanytype.

pNoloopsareallowedinmultigraphs(uv).

Copyright