Scribd Logo
Upload

Welcome to Scribd!

  • Graph Theory

    Uploaded by

    api-26548538
    439 views18 pages
    MFCS notes on Graph Theory [Unit VII and Unit VIII]

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    MFCS notes on Graph Theory [Unit VII and Unit VIII]

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    439 views18 pages

    Graph Theory

    Uploaded by

    api-26548538
    MFCS notes on Graph Theory [Unit VII and Unit VIII]

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF or read online from Scribd
    Flag for inappropriate content
    of 18
    Grapt theory ‘wapk: A oes 3{¥, E) consists of two sets V={ v: , v2, va} celled vertex set and 2:52. m)} called edge set suo’ “hat each edge ey associated with an pair (v;, yj) i€v;, 4) }] of vertices . The vertices vi . vj associated with e 4 ane OR A gray 2 pair (V,E) of sets , V nonempty and each element of E a set of two distinct elements of V. Tre etements of V are called vertices; the elements of © are called edges. © then it is cailed null grapi.it is der od by Ny edge can be associated with vertex pai: (, vi} called self loos. More a given air of vertices called gazelle! edges. e graph: Graph with ao paratle! edges and ne self loops . Otherwise itis called ple graph. Finite Gragias A graph with finite number of vertices and edges. Otherwise itis called Directed graph: Every edge is directed (associated with a ordered pair of vertices). Every edge is associated with unordered pair of vertices then it is caliec undirected graph. Otherwise it is called mixed graph ( ie some edges are directed and some edges are undirected). Degnee of « vertex : The number of edges which are incident with that vertex.(counting each loop twice} x degree of 2 vertex in a Directed Graph is number of vertices which are incident to the vertex denoted by deg * (v) Out degree of vertex in a Directed Graph is number of vertices which are incident from vortex denoted by deg (v). =o grack Cesory(lad shaking iemma): The sum of the degrees of aif equal to twice the number of edges. k Wiest the ve: sam of the in degrees of all vertices = the sum of out degrees of ail vertices = the number of edges. If deg (v}= 0 then v is called isolated vertex. deg (v)=1 then v is called pendant vertex.(Pendent vertex adjacent to exactly one verter. ) if deg (v)=even then v is called even vertex If deg (v)= odd then v is called odd vertex. wpe Note : The number of odd vertices in a graph is always even. (di, Gay. a) is called the degree sequence where ude are degree of the vertices in ascending order. )= max {deg(v)} * 8(G)= min (deg(v)) * KGYVIS 21E| * AGYVIE 2151 *0<8(G)

    You might also like