Discrete Structures and Theory of Logic (DSTL) Graph theory Handwritten notes
Important links :-
Importance of these notes
"DSTL ki Unit 5 ke ye notes kisi bhi college going student ke liye jaruri h jo AKTU se B.Tech pursue kr rha h kyuki In notes ke andr hmne wo saari important cheeje di h jo ki iss chapter ke point of view se important h jaise graph,planar graph, bipartite graph, complete bipartite graph etc. Ye sabhi topic ek CS student ke liye bohot jaruri h kyuki graph theory ek aisa subject h jo hm Data structure ke andr bhi padhte h aur iss chapter use bohot saari jagah pr hota h. Agar iss chapter ko achhe tareeke se samjha jae toh students ka base strong ho jata h engineering ka. Now talk about "How these notes will help to understand the topics of Graph theory" Kyuki ye notes dono hi tareeke se available h hmari website pr Handwritten as well as online lecture ke notes toh kisi bhi student ko jo method jyada effective lgta ho wo uss method se notes ko pdh skta h, But jb hm notes ko handwritten method se padhte h toh usse hmara focus aur consistency increase ho jati h kyuki sara data ek aise way mai presented rhta h jisse hm cheejo ko samajh ske aur conceptual knowledge ko gain kr ske. "
Notes of Graph theory (Unit 5) DSTL
1. Graph :- Graph ek collection hota h Set of vertices and set of edges ka jisme hr vertex ek dusre se ek edge ke through jude rhte h. 
ex: Image mai jo graph dikh rha uske andr number of vertex 4 h aur number of edges bhi 4 h. vertex ko hm V se represent krenge and edges ko hm E se represent krenge.
V={A,B,C,D}
E= {e1,e2,e3,e4}
#representation of a graphGraph ke representation se matlab hota h ki graph ko memory ke andr kis tarah represent kiya jata h. means graph ko memory mai kis tarah store kiya jata h waise toh iske do tareeke hote h- Matrix representation and linked list. in dono tareeko mai commonly used tareeka matrix representation ka hota h. Matrix representation mai bhi do method hote h phla ordered graph ke liye dusra tareeka hota h unordered graph ke liye. ordered graph ke andr jin vertex ke beech mai edge ho wha 1 likhte h aur jha edge na ho wha 0 likhte h. aur unordered graph ke andr kyuki direction hoti h jis vertex se hm kisi dusri vertex pr ja skte h wha pr 1 aata h aur jha nai ja skte wha 0 aata h.
2. Bipartite Graph: Bipartite Graph is a type of graph jiske andr jo set of vertices hote h usko do suset ke andr divide kr diya jata h, But uske bhi kuch rules hote h jaise Dono end point graph alg alg set mai hone chahiye aur ek set ke vertex apas mai connected nai hone chahiye.
Upr wale photo mai hmare pass do sets h phle set mai 1,2,3,4,5 element h aur dusre set mai A,B,C,E element h aur phle dono sets mai element ek dusre connect nai h. Hence ye bipartite graph h.
3. Complete Bipartite Graph: Complete Bipartite Graph is a type of graph in which Phle set ke vertex dusre set ke sbhi vertex ke sath connect hote h. Aur dusre set ka he ek vertex bhi phle vertex ke every element se connect Krna.
4. Graph coloring:Graph coloring ek method hota h jiske through hm Graph ko coloured among with some certain rules jaise adjacent vertex ko same colour nai de skte etc.
5. Planar Graph:Planar graph wo hota h jiske andr koi bhi do vertex apas mai ek dusre ko intersect nai krti h usko planar graph khte h.
6. Isomorphism: Isomorphism Graph wo graph hote h jinke Number of vertex and edges toh same rhti h lekin unki shape alag hoti h aise graphs ko isomorphism graph khte h.
7. Homomorphism: Homomorphism Graph wo hota h jiske andr hm kisi graph ke mai vertex add krke aur dusra graph bnate h.
Weightage of Unit 4 (Graph Theory) in exam
If you want Unit 2 and unit 3 notes then click below 👇👇👇👇👇
Comments
Post a Comment