Scribd Logo
Upload

Welcome to Scribd!

  • 21CS4113

    Uploaded by

    Aniket Pyne
    10 views3 pages
    The document discusses properties of complementary graphs. It states that if G(V,E) is a graph, then its complement G'(V,E') will have the same set of vertices V but the edges in E' are all possible edges that are not in E. It also notes that if the degree of every vertex in one graph is k, then the degree of its complement will be |V-1|-k. Finally, it uses this concept to show that a graph with 19 vertices cannot have a maximum degree of 12, as its complement would not be possible.

    Original Description:

    Original Title

    21CS4113 (6)

    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 complementary graphs. It states that if G(V,E) is a graph, then its complement G'(V,E') will have the same set of vertices V but the edges in E' are all possible edges that are not in E. It also notes that if the degree of every vertex in one graph is k, then the degree of its complement will be |V-1|-k. Finally, it uses this concept to show that a graph with 19 vertices cannot have a maximum degree of 12, as its complement would not be possible.

    Copyright:

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

    21CS4113

    Uploaded by

    Aniket Pyne
    The document discusses properties of complementary graphs. It states that if G(V,E) is a graph, then its complement G'(V,E') will have the same set of vertices V but the edges in E' are all possible edges that are not in E. It also notes that if the degree of every vertex in one graph is k, then the degree of its complement will be |V-1|-k. Finally, it uses this concept to show that a graph with 19 vertices cannot have a maximum degree of 12, as its complement would not be possible.

    Copyright:

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

    Amiket Pye

    21C 413
    L C be gaph with n vetiees ~ ealje

    th We
    Tf that is 50 en w
    C s
    1 1 Coneetl -
    Janm a tree wth elge
    v t h m-l edges
    KMs vtiees l
    t h ene is still
    while av6idy eqeles b* the
    then

    wiRlL fonm egele


    so
    Sne mone edge

    fhen 6ne o the e omponeg


    Cis not e onneetel
    elsey it wil
    y6. ot vetiees 4 4o

    wi have ame

    neadtea ejele

    Let CV,E) i one gnoph GCy,E')i


    od h
    the complement
    to be sck eomplementaay, C
    a
    As it s soi
    N ov)
    E+E
    Cv-1
    2E
    Cv- t)
    then
    A S
    E aw) mteyen Then

    eithen
    i s mutiple ad 4 V-1) is maltiple
    o

    V- 4 k

    V4k Ik t |

    i th b
    e k e0m plemen tany 4mple gapk

    CAtrees

    tiees

    Z N
    thene is 19 cdes

    leg ( 19 *2 38

    e also hav eyC)3


    ve
    Je:
    No i we inaplyivige
    12 7

    whveh is n6t possible.

    with
    e an
    instead have v e ti e e s
    .
    1,and OmecAtey witk degee
    depree

    o entiees is 2
    12
    M64
    Max pos sibl e mo.

    You might also like