Scribd Logo
Upload

Welcome to Scribd!

  • 10 views

    Notes 5

    Uploaded by

    Khushi rawat
    The document discusses graph theory concepts like planar graphs, Euler's formula, Hamiltonian cycles, and bipartite graphs. It covers topics such as the number of edges and faces in planar graphs, decomposing graphs into two vertex-disjoint subgraphs, and special cases like when the graph is a cycle.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Notes 5

    Uploaded by

    Khushi rawat
    10 views3 pages
    The document discusses graph theory concepts like planar graphs, Euler's formula, Hamiltonian cycles, and bipartite graphs. It covers topics such as the number of edges and faces in planar graphs, decomposing graphs into two vertex-disjoint subgraphs, and special cases like when the graph is a cycle.

    Original Description:

    About Euler Graphs in discrete mathematics

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document discusses graph theory concepts like planar graphs, Euler's formula, Hamiltonian cycles, and bipartite graphs. It covers topics such as the number of edges and faces in planar graphs, decomposing graphs into two vertex-disjoint subgraphs, and special cases like when the graph is a cycle.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    10 views3 pages

    Notes 5

    Uploaded by

    Khushi rawat
    The document discusses graph theory concepts like planar graphs, Euler's formula, Hamiltonian cycles, and bipartite graphs. It covers topics such as the number of edges and faces in planar graphs, decomposing graphs into two vertex-disjoint subgraphs, and special cases like when the graph is a cycle.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 3

    ph

    al th
    nEulo ptP ot loast one
    ee 9 the ap
    9 u
    Le swpcoeol

    ule palh
    a oth knot edge agop

    Cxact onu tonubis Crou venhie


    i u l u path the
    u duteont

    Culc CscLut Cus


    hal
    C CroCut
    On ulo Cisc u i t i s
    33cpt ekacty 0na
    C y eoe e a
    dn thi ho kat ancd end

    he

    a Connotud ph qCA an tulo, rap

    i4 au esti c o au of ese oagu

    Kegiona /Faces

    3UrUoundsol L7 edpes o pypl


    Eulu fosmula, plana
    V-e +f = 2 ne to he botinfiec
    fo plounqr 3apk
    Hamu lto nu aun oapl
    all reunceo mould ee tsttod
    Exacty ona (4
    But Ahe HP I 2 3 9

    Endim 90te ould b


    ifeent .
    MP> A 8 C DE

    a v tona Crcuut
    Se Stot & end v

    t P X

    (B-
    Sima 86p h exiai
    ahammttonian pociTci
    7 u siU exist a R.P.

    bipatit C oal
    atto Atbo noun big-aph
    In this p h we Can clecompor | dud
    two vcl
    to
    at COn nO oa otneol
    -Lti Clo e e n e
    uth each l h u

    (5)
    Wter
    Opata bipaultde Cyop

    Covesuo
    edges lo ba,
    eop a Regio

    (
    R
    Des R 3
    De Kz lunbamda)
    3

    2 K RR 4
    3

    R55

    Speciae Cas e
    De P 3
    t 5
    R2

    E m a 0gi G we have Cut edge


    n0t Cuakiny
    paut a Ciocul hon in ounked

    You might also like