Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Discrete Structure:- Graph Theory, Study notes of Discrete Structures and Graph Theory

Study notes for graph theory and combinations from the subject DISCRETE STRUCTURE AND THEORY OF LOGIC. These notes can help in exams , preparation and revision. These are handwritten notes.

Typology: Study notes

2023/2024

Available from 02/04/2025

aditya-mishra-20
aditya-mishra-20 🇮🇳

4 documents

1 / 61

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a
pf1b
pf1c
pf1d
pf1e
pf1f
pf20
pf21
pf22
pf23
pf24
pf25
pf26
pf27
pf28
pf29
pf2a
pf2b
pf2c
pf2d
pf2e
pf2f
pf30
pf31
pf32
pf33
pf34
pf35
pf36
pf37
pf38
pf39
pf3a
pf3b
pf3c
pf3d

Partial preview of the text

Download Discrete Structure:- Graph Theory and more Study notes Discrete Structures and Graph Theory in PDF only on Docsity!

UNIT-5 Gaaph Theory and Comb inatovi Graphs prate CVE, YP) tn Wie UV ya vextis Cnodes) » EB the Set © the 4 E to the edges and Y ba , from te % unenlanad ool pads o% laments of V, 1 Van} Veter bet VC) =4 MY, Vg, --- Edge Aet Beg) = § te O- u,v EVG)} Graph is denoted by GHC E) or GOB). Basic Teunino leat, : = ¢G O Incident edaes an eolge C6 E thal joins the ventions and u ds Aatd do be fuctlent on eat % Us ond Potuls UW oma U. Acljacent Vewthes t pary fais, of vertices thal iy Connected by an edge in a graph v5} called Adjacent vortices. @ Isotated Vertex A Vortex thal iy not adjacenl to amothor Vesetex <3 Called an Lsolated vortex. ce) Finite amd Infinite Geeph : A Graph QU, E) iy sod Jo be porite 4 St has a finite number 4 vedties ond pinlle number edges. oteawise, $1 4s an Infiuite Goapi &) Poder 0 a Graph? I$ G is a finite Graph, Thon the number % vertins in G i Called ordek oh G, denoted oT Pe 4 ei bf ee 4 (@) Size *h_2 Graphs In a fintie Graph Gye) » Ihe no 4 edges ts tatted Mxe 4G, denoted by LE@)| , orm = A Gah % 1 ordey and m Ata is Agovud as tn,m)