Scribd Logo
Upload

Welcome to Scribd!

  • Theorems

    Uploaded by

    Shadowed
    17 views31 pages
    The document discusses properties of graphs and cycles. It proves that a graph G with n vertices and m edges can be decomposed into cycles if and only if m is greater than or equal to n. It also shows that if G contains a cycle, it must contain a cycle of length 3, 4, or 6. The graph is decomposed into cycles by beginning at a vertex and following a closed walk along the edges.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses properties of graphs and cycles. It proves that a graph G with n vertices and m edges can be decomposed into cycles if and only if m is greater than or equal to n. It also shows that if G contains a cycle, it must contain a cycle of length 3, 4, or 6. The graph is decomposed into cycles by beginning at a vertex and following a closed walk along the edges.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    17 views31 pages

    Theorems

    Uploaded by

    Shadowed
    The document discusses properties of graphs and cycles. It proves that a graph G with n vertices and m edges can be decomposed into cycles if and only if m is greater than or equal to n. It also shows that if G contains a cycle, it must contain a cycle of length 3, 4, or 6. The graph is decomposed into cycles by beginning at a vertex and following a closed walk along the edges.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 31

    Charndlunslas Elenaw rhs

    Ohe stateme euwweut t r

    Cownetul

    Elena Eey vetes fhao


    C1 G
    eww degreee
    e baEtiema
    GCam
    heset f adges
    imto Cteles

    O
    Let z be dn Eter
    iven GEleran
    Ame of G. Let a
    buls 2 t
    Conri
    w
    O C C u a n Ca

    Vand
    dagus
    As V asrdra
    eew
    has er olegre
    aw velea G

    n Trvi,
    c l d amd
    Smea C Conne

    So G
    ha degiee atasF
    atlast 2
    2, So
    ev veles G
    he
    Conlaun a Cycla.
    edgs C hylls a Span
    SWUC has Cve

    wich
    w
    (3) alread
    has
    ho edges, Th
    Jegee te umen
    kebla
    holds; uswise, a
    ppidt , C rutts h
    aga all veriits a t dugaea, de

    okim tatly dis Cemmettud p Gn


    Obtaincd, we have O las 6 the

    edges C
    G mto Cyels

    he cles 6
    0 Let C
    C e m

    thi arkam Conaust


    G nly T h i

    ele Kew C obriongly Elera heswse,


    ele CC wnf
    Thur amr hu
    V Camm w C. he w l begnung
    at V mo Cm o n g te Celes G2G
    cused wlk Claunng
    w

    TKe thoe w Cyeles. yitae


    cam CmsTnua
    ontuwuuns P es, we

    hee
    wsedwu Coniamg edges
    Eena

    You might also like