Professional Documents
Culture Documents
Gisatree. Part A (10 X 2 20) Answer Any Ten Questions.: Muád® MLT® Fiy¡Fšÿç (J DH Á), E JD, BR Id - 35
Gisatree. Part A (10 X 2 20) Answer Any Ten Questions.: Muád® MLT® Fiy¡Fšÿç (J DH Á), E JD, BR Id - 35
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;