Partial preview of the text
Download Discrete Structure:- Graph Theory and more Study notes Discrete Structures and Graph Theory in PDF only on Docsity!
UNIT-5 Gaaph Theory and Comb inatovi Graphs prate CVE, YP) tn Wie UV ya vextis Cnodes) » EB the Set © the 4 E to the edges and Y ba , from te % unenlanad ool pads o% laments of V, 1 Van} Veter bet VC) =4 MY, Vg, --- Edge Aet Beg) = § te O- u,v EVG)} Graph is denoted by GHC E) or GOB). Basic Teunino leat, : = ¢G O Incident edaes an eolge C6 E thal joins the ventions and u ds Aatd do be fuctlent on eat % Us ond Potuls UW oma U. Acljacent Vewthes t pary fais, of vertices thal iy Connected by an edge in a graph v5} called Adjacent vortices. @ Isotated Vertex A Vortex thal iy not adjacenl to amothor Vesetex <3 Called an Lsolated vortex. ce) Finite amd Infinite Geeph : A Graph QU, E) iy sod Jo be porite 4 St has a finite number 4 vedties ond pinlle number edges. oteawise, $1 4s an Infiuite Goapi &) Poder 0 a Graph? I$ G is a finite Graph, Thon the number % vertins in G i Called ordek oh G, denoted oT Pe 4 ei bf ee 4 (@) Size *h_2 Graphs In a fintie Graph Gye) » Ihe no 4 edges ts tatted Mxe 4G, denoted by LE@)| , orm = A Gah % 1 ordey and m Ata is Agovud as tn,m)