Scribd Logo
Upload

Welcome to Scribd!

  • Gisatree. Part A (10 X 2 20) Answer Any Ten Questions.: Muád® MLT® Fiy¡Fšÿç (J DH Á), E JD, BR Id - 35

    Uploaded by

    Vicky Vicky
    7 views3 pages

    Original Title

    162125

    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

    Copyright:

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

    Gisatree. Part A (10 X 2 20) Answer Any Ten Questions.: Muád® MLT® Fiy¡Fšÿç (J DH Á), E JD, BR Id - 35

    Uploaded by

    Vicky Vicky

    Copyright:

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

    muÁd® Mlt® fiy¡fšÿç (j‹dh£Á), eªjd«, br‹id - 35.

    24. If G (p,q) is a graph, Prove that the following statements are


    equivalent. CODE: 162125 TIME: 2 Hrs
    (i) G is a tree. NOVEMBER 2020 MAX. MARKS: 50
    (ii) Every two points of G are joined by a unique path. PART A (10 x 2=20)
    (iii) G is connected and p = q + 1. Answer any TEN questions.
    (iv) G is acyclic and p = q + 1.
    1. Draw the Petersen graph.
    G (p,q) vd;gJ xU Nfhl;LU vdpy; fPo;f;fz;lit gPl;lh; nrd; Nfhl;LUit tiuf.
    xd;Wf;nfhd;w rkkhdit vd epWTf.
    2. When do you say that two graphs are isomorphic.
    («) G vd;gJ xU kuTU. ,uz;L Nfhl;LUf;fs; rk xg;Gik cs;sit vd vg;NghJ
    (¬) G apd; ve;j ,U Gs;spfisAk; ,izf;Fk; ghij $Wtha;.
    xd;W kl;LNk cz;L.
    3. Define degree sequence of a graph.
    (þ) G ,ize;jj kw;Wk; p = q + 1. xU Nfhl;LUtpd; gbj; njhliu tiuaW.
    (®) G Rw;ww;jhfTk; kw;Wk; p = q + 1.
    4. Find all blocks of the following graph.
    25. Show that a weak diagraph D is Eulerian if and only if every point
    of D has equal indegree and outdegree.
    xU gykw;w jpirNfhl;LU D MdJ Ma;Nyhpad; Mf
    ,Ue;jhy; kl;LNk D apd; xt;nthU Gs;spapd; cs;gbAk;
    ntspg;gbAk; rkkhf ,Uf;Fk; vdf; fhl;Lf.

    Nkw;fhZk; nfhl;LUtpd; midj;J fl;lq;fisf; fhz;f.

    5. Define Eulerian graph and give an example.


    Ma;yphpad; Nfhl;LUit vLj;jf;fhl;Lld; tiuaW.

    6. Prove that every Hamiltonian graph is 2-connected.


    midj;J N`kpy;Nlhdpad; Nfhl;LUTk; 2 ,ize;jJ vd
    epWTf.

    7. Draw any four trees with 8 vertices.


    Gs;spfisf; nfhz;l ehd;F kuTuf;fis tiuf.

    8. Define spanning tree of a graph.


    xU Nfhl;LUtpd; glh; kuTUit tiuaW.
    9. Define directed cycle. kl;LNk x MdJ G apd; ve;j xU R+oypYk; ,Uf;fhJ
    jpirf; Row;rpia tiuaWf;f. vdf;fhl;Lf.
    10. Write down the three types of connectedness in diagraphs. 19. Prove that any self complementary graph has 4n or 4n+1 points.
    jpir tiuGfSf;fhd %d;W tpjkhd ,izg;Gfis xU Rakpif epug;G Nfhl;LUtpy; 4n my;yJ 4n+1 Gs;spfs;
    $Wf. ,Uf;Fk; vd epWTf.
    11. Define block of a graph.
    20. If G is a block with n ≥ 3, Prove that any two edges of G lie on a
    xU Nfhl;LUtpd; njhFg;G gw;wp tiuaW.
    common cycle.
    12. Define spanning tree of a graph. G xU fl;lk; NkYk; n ≥ 3, vdpy; G y; cs;s ve;j ,U
    xU Nfhl;LUtpd; glh; kuTUit tiuaW.. tpspk;GfSk; xU nghJ Rw;wpy; mikAk; vd epWTf.
    PART B (2 x 5=10) PART C (2 x 10=20)
    Answer any TWO questions. Answer any TWO questions.

    13. Define intersection graph. Show that every graph is an intersection 21. Prove that the maximum number of lines among all p point graphs
    graph.  p2 
    ntl;Lf; Nfhl;LUit tiuaWf;f xt;nthU Nfhl;LUTk; with no triangles is  .
    xU ntl;lf; fhl;LU vdf; fhl;Lf.  4 
    Kf;Nfhzq;fisg; ngwhj p Gs;sp Nfhl;Luf;fsy; mjpfgl;r
    14. Explain the algorithm to determine whether a given partititon P is  p2 
    graphical. NfhLfspd; vz;zpf;if vd   epWTf.
    nfhLf;fg;gl;l gq;fPL P MdJ xU tistiuiaf;  4 
    Fwpf;Fk; vdf; fhz;gjw;fhd Kiwia vOJ. 22. Show that for any graph G, k ≤ λ ≤ δ . Give an example to show that
    the inequality may be strict.
    15. If G is hamiltonian, Prove that for every non empty proper subset S ve;j xU Nfhl;LU G- f;Fk; k ≤ λ ≤ δ vdf;fhl;Lf. ,e;j
    of V(G), ω (G − S ) ≤ S . rkdpd;ikfs; jpl;lkhf ,Uf;fyhk; vd;gjw;F rhd;W xd;W
    G vd;w N`kp;y;Nlhdpad; Nfhl;LUtpy;..S vd;gJ .V(G) apd; jUf.
    xU ntw;ww;jF cl;Fzk; vdpy; . ω (G − S ) ≤ S vd epWTf. 23. Prove that the following statements are equivalent for a connected
    16. Show that a vertex v of a tree G is a cut vertex if and only if d (v) > 1. graph G:
    (a) G is Eulerian
    ´Õ G vd;w kuTUtpd; xU Kid ntl;L Kidahf (b) Every point of G has even degree
    mikaTk; kw;Wk; ,Ue;jhy; kl;LNk d (v) > 1 vd epWTf. (c) The set of edges of G can be partitioned into cycles.
    17. If two diagraphs are isomorphic, Prove that corresponding points
    have the same degree pair. xU ,ize;j Nfhl;LUtpy; fPo;f;fz;l $w;Wfs; rkkhdit
    ,U jpirapl;l Nfhl;LUf;fs; rk xg;Gik cilajhapd; xj;j vd epWTf.
    Gs;spfs; rkgb N[hbfisg; ngw;wpUf;Fk; vd epUgp. (m) G vd;gJ Ma;Nyhpad;
    (M) G d; xt;nthU KidAk; ,ul;ilg;gil Kid cwT
    18. Show that a line x of a connected graph G is a bridge if and only if x vz;izf; nfhz;ljhf ,Uf;Fk;.
    is not on any cycle of G. (,)G d; NfhLfspd; fzj;ij Row;rpfisf; nfhz;L
    ,ize;j Nfhl;LU G apd; xU NfhL ghykhf ,Ue;jhy; gphptpid nra;a KbAk;

    You might also like