Planar Graph | Euler's Formula with Proof | Complete Graph K5 is Nonplanar | K3,3 is Nonplanar
ฝัง
- เผยแพร่เมื่อ 11 ต.ค. 2024
- DISCRETE STRUCTURES AND THEORY OF LOGIC
UNIT-5
TREES, GRAPH THEORY, RECCURRENCE RELATION AND COMBINATORIES PLAYLIST
DISCRETE MATHEMATICS
LECTURE CONTENT:
GRAPH THEORY IN DISCRETE MATHEMATICS,
PLANAR AND NONPLANAR GRAPH,
EXAMPLES OF PLANAR GRAPH,
EXAMPLES OF NONPLANAR GRAPH,
COMPLETE GRAPH K5 IS NONPLANAR,
KURTOWASKI FIRST GRAPH IS NONPLANAR,
EULER'S FORMULA AND ITS EXAMPLE,
REGIONS IN PLANNAR GRAPH,
EULER'S FORMULA PROOF,
COMPLETE BIPARTITE GRAPH K3,3 IS NONPLANAR,
KURTOWASKI SECOND GRAPH IS NONPLANAR,
Graph theory discrete mathematics, graph theory, definition and terminology of graphs, graph discrete mathematics, planar graph, planar and non planar graphs, proof of euler's formula.
(COMMUNICATION LINKS)
1. TH-cam CHANNEL LINK:
/ @dr.anuj.fearlessinnoc...
2. TELEGRAM LINK:
t.me/joinchat/...
3. FACEBOOK GROUP LINK:
www.facebook.c...
By: Dr. Anuj Kumar
Assistant Professor (Mathematics)
Ph. D, Gold Medalist in M. Sc and B.Sc.
National Fellowship (JRF & SRF) Holder During Ph. D.
DISCRETE STRUCTURES AND THEORY OF LOGIC MODULE-5
KSC303
DISCRETE MATHEMATICS
DISCRETE STRUCTURES AND THEORY OF LOGIC UNIT 5 PLAYLIST
DISCRETE MATHEMATICS PLAYLIST
DISCRETE MATHEMATICS FULL COURSE
DISCRETE MATHEMATICS FOR COMPUTER SCIENCE
DISCRETE MATHEMATICS BTECH 2ND YEAR
DISCRETE MATHEMATICS BSC 1ST YEAR
DISCRETE MATHEMATICAL STRUCTURES
DISCRETE MATHEMATICAL STRUCTURES FOR COMPUTER SCIENCE
DISCRETE STRUCTURES COMPUTER SCIENCE
DISCRETE STRUCTURES UNIT 5
DISCRETE STRUCTURES MODULE 5
DISCRETE STRUCTURES LECTURES
DISCRETE STRUCTURES PLAYLIST
DISCRETE STRUCTURES AND THEORY OF LOGIC AKTU
DISCRETE STRUCTURES AND THEORY OF LOGIC BTECH 2ND YEAR
DISCRETE MATHEMATICS UNIT 5
DISCRETE MATHEMATICS MODULE 5
DISCRETE STRUCTURES AND THEORY OF LOGIC SYLLABUS AKTU
DISCRETE STRUCTURES FOR COMPUTER SCIENCE
DISCRETE STRUCTURES FOR COMPUTER SCIENCE BTECH 2ND YEAR
DISCRETE MATHEMATICS FOR BCS 1ST YEAR
DISCRETE MATHEMATICS AKTU
DISCRETE MATHEMATICS PLAYLIST AKTU
BY DR. ANUJ KUMAR SIR
BY ANUJ KUMAR SIR
@FEARLESS INNOCENT MATH
#discretestructure #kcs303
The induction proof was simple and easy to understand. Thank you
Thanks dear💕
@@dr.anuj.fearlessinnocentmath sir aapne formula galat lagaya hoi kurtoski second graph proof me 2e>=3f hai 4 f nehi . olz explain if i m wrong
SIR in k3,3 theorem you have take 2e>=4f but in inequalities you have written 2e>=3f ????
Hum ulta maan ke chale hai dear
To graph ke according maximum edges ka region se inequality lenge. Jisme 4 edges aayega.
Sir ek dought tha.,......
Aapne induction formula me
k, k+1
Ki jaga
n-1, n
Kyu lya
Please 🙏
Explain
In comment or reply
Koi bhi consecutive number le sakte hai dear jaise 9,10
7,8
n, n+1
n-1, n etc
Ok, sir
Thank you sir.. ❤
sir aapne formula galat lagaya hoi kurtoski second graph proof me 2e>=3f hai 4 f nehi . olz explain if i m wrong
Formula is correct
Inequality ye proof krayi thi
Lakin formula graph ke hisab se use hoga
sir ye 24 videos wali playlist pichle year k liye thi na?, ab ye 16 yr wali hi is saal k liye pdni hia na ?
2023-24 ki playlist se ker lo ❤
Sir combinatorics ka topic par video nhi dikh rha
Syllabus me hai
I will upload dear
Bhai 2nd year?😢
sir aapne k3 wale question me inequality ka formula 4f liya, lekin uske pehle aapne smjhate waqt uss formula me 3f likha tha, 2e
Kis time per
Sir, recurrence relation using generating function
Ye topic previous year question mei boht baar 10Number mei aaya hua hai
Apse request, ap ye topic bhi cover kijiye
And Thank for your support ☺️💓
Please 🙏
Ok dear
yess sir plz if possible do make it 😭
@@ziaurrehmanmalik9852 ho to gya cover.... Sir ne kbka kra diya hai
@@Rohit_prajapati.. bhai video no bta d plz😭
@@ziaurrehmanmalik9852 visit playlist of dstl
Nice lecture sir❤😊
Thanks dear💖💖
Sir combinatorics ka video bhi upload kar dijiye please
Ok G
sir plz upload fast@@dr.anuj.fearlessinnocentmath
Sir pls provide MSc maths final graph theory notes only prove questions.
Notes to nhi hai dear
Combinatorics ki video kab upload hogi sir?
Exams are near
Very soon
Sir combinatorics par bhi video upload kar dijiye
Ok g
Sir why you use 2e >=4f in proof of K3,3 while you tell condition 2e >=3f ? Please tell me.
Contradiction method ke liye
Sir to contradiction ke liye 2e ≥ 3f lenge uske bad results satisfied nhi hoga tab to bolenge na ki planner nhi h.
Quki jab aap 4f loge to galat aana hi hai to contradiction karne ke liye hum inequality me change q karenge@@dr.anuj.fearlessinnocentmath
Thanks 🙏🙏 sir
Welcome dear❤❤❤
Sir is bar hai kurtowksi graph syllabus me ???
Yes
Ok sir
Sir aapka totally Study material gateway classes dwara churaya ja rha hai
Yes dear, I know
Ap assistant professor kaha pe ho .
ABESIT
@@dr.anuj.fearlessinnocentmath wow mera exam centre pada tha waha par
@@namelessmonster8139
Nice dear
@@dr.anuj.fearlessinnocentmath sir aaj dstl ka paper ha bhot darr lagra hai
Predicate logic or quantifires unit 5
Yes
sir pleaze provide descrete mathematics notes
DSTL ke notes nhi hai dear
@@dr.anuj.fearlessinnocentmath okk sir,but sir hote toh bhot easy ho jata learn krna
Thanks sir 😄
Welcome dear
Why not I am like your & subscribe your channel sir
Sir,
K(3,3) ko non planer proof krne ke liye aapne contradictory method lagaya
Yaani aapne mana ki k(3,3) planer hai. Hence is should obey the equality (2e>=3f) .
Pr ye chiz proof ni ho paati to aap likhte ,(Hence our assumption is wrong so it will be non planer)
Pr vo proof ho ni rha tha to aapne ise zabardasti proof krne k liye (2e>=4f) kr diya
Hum ulta maan ke chale hai dear
To graph ke according maximum edges ka region se inequality lenge. Jisme 4 edges aayega.
To sir inequality 2e ≥ 3f me
3 ke badle region of maximum edges hi likh de.
Sorry bol dete hai is funny 🤣
🙏🙏🙏🙏🙏