08:00 For self loop, we can also use 1 in incidence matrix. Because there will be no other 1 in the self-loop edge column. That'll only indicate that there's a self loop .
sir plz make a video on eulers formula and kuratowski theorem of graph theory it is in my syllabus, and your videos are really helpful , thank you so much for sharing that quality knowledge.
Answer: It will have 3 vertices..and only this fact can give the answer . Additionally, no self loops will be there as diagonals are 0 and no multi edges bcoz all non diagonals are 1 .
Sir adjency matrix 2 qution you have wronged in last step b matrix c is 2 you have written and then e mateix c also 2 you have to write sir but you have written 1 why
00:02 Matrix representation of a graph in graph theory 01:55 Matrix representation of graph in graph theory 05:04 Matrix representation of the graph in Graph Theory. 06:42 Matrix representation of a graph summarizes the connections between vertices. 09:54 Calculating the incident matrix in Graph Theory 11:32 The video discusses graph theory and matrix representation of graphs. 14:54 Matrix representation of a graph in graph theory 16:27 Matrix representation of the graph shows the connections between vertices 19:30 The matrix representation of a graph in graph theory
➡ Incase you missed previous Videos of Discrete Mathematics =
Playlist of Discrete Mathematics - ua-cam.com/play/PLU6SqdYcYsfJ27O0dvuMwafS3X8CecqUg.html
Option B is correct
Answer :- Triangle ABC
Option B is correct answer.
Thank you sir 👌👌🙏🙏
yup
Absolutely
Yeah
Correct 😊
The graph contain 3 vertices so, no need to check the figure ..... simply optain B is correct .
thank you SIR for these valuable content .
option B is the correct answer of adjacency matrix and the graph is simple and undirected graph ❤
Sir the answer is option b . Thank you sir . Your teaching is very nice and so easy to understand ❤❤!!
Thank you sir because of you I understand the main topic and i was thinking that this is hard but it's very easy..... Thank you 😊❤️
Very underrated teacher your lectures are very helpful for engineering students.
Exactly 💯 don't forget to share with your friends 😊
i am a LPU student in 1st yr.
sir your video is very helpful for me to getting marks ❤
kiya krr skte hai...pass krwane me sir ka hi hath hai....lpu wale to chutiya bnate hai faculty ke nam pe
@@raviroushan1073 hahaha
you guys studying this in 1st year , in bengal it's in 2nd year and 1st year was corona lockdown so online exams hahahaha , 9.6cgpa in free
@@Sarkar.editsz cgpa ka kya achar daale ga
@@Sarkar.editsz every free thing is harmful.
19:53 answer is B since it has only 3 vertices ;)
Love you sir very nice explain kiya apne sach mai Maja aa gaya love you sir or last wala question kaa answer B hoga
08:00 For self loop, we can also use 1 in incidence matrix. Because there will be no other 1 in the self-loop edge column. That'll only indicate that there's a self loop .
but edges are not same dude
I think , as we know every edge contributes 2 deg and in incidence matrix we are adding deg .
puchha kisi ne 😛
You are right
Thank you sir 🙏🙏
I got 77 marks out of 80 in differential equation.
But you comment on graph theory video?
@@Mohitbajaj792 vahi to this is called intelligent chutiya🤣🤣🤣🤣🤣🤣
And I got 690 in NEET thank you sir for teaching me sanskrit
@@joshiharsh1943 😂😂😂😂😂😂
@@joshiharsh1943 😂😂🤣
Sir please make videoes on recurrence relations and generating recurrence relations
Already there
@@deepitsharma6462 hiii
@@deepitsharma6462 where
Thankyou so much sir tomorrow my university exam , you clear my doubts on this topic
HARE KRISHNA HARE KRISHNA KRISHNA KRISHNA HARE HARE HARE RAM HARE RAM RAM RAM HARE HARE
Allah'Uh'Akhbar
True 😂😂
@@themaskedgriffin6384 jai shree ram 🧡
हरे कृष्ण 🦚
OPTION B,TIME;5secs.....THANK YOU SIR for this amazing playlist indeed...
Last que ans: option B
Thank you sir for the explanation 🙌
b is the correct option. and it took me 1 minute to solve the question!
thank you for the lecture sir.
option "B" is correct.tysm sir for existing lol
(lots of love)
You teach way better than our faculty teachers, you are the reason maths is still understandable to me.
Jai Shree Ram sir❤🙏
Really helpful lecture and the correct answer is B (ABC)
Thanku sir
Your contents are
easy to understand
Thank you sir. Option B.
Time taken to solve - 1 min
The answer of the question is option B (Triangle).
Thank you sir 😊
Thank you so much sir ❤️🙏
Ans - B
Sir option b is correct
I solved it too fast thanks sir 😊
Sir aapko dher saara thank you and sir humko aapki zarurat hai iska dhyaan dene ki zarurat hai
Answer - B
Thankyou you sir🙏🏻
sir plz make a video on eulers formula and kuratowski theorem of graph theory it is in my syllabus, and your videos are really helpful , thank you so much for sharing that quality knowledge.
17:28 sir v2 mei self loop hai to v2, v2 vali entry 2 ho jayegi na sir??
Self loop Mei yeh aek exception hai
❤ NO WORDS SALUTE YOU SIR
(H.W )
Option B is correct sir ..Thank u 😍😍
Good communication Sir. Love from Pakistan 🇵🇰❤️
15 second only wow sir kya samjhate hai aap 🙏🏻🙏🏻🙏🏻
Awesome video 📸🎉🎉
Option -B,Thank you so much sir
thank you sir for explaining this would help me in my exams😇
Last answer B
You are awesome Sir
Thank you so much
Answer of the last question is : Option B
Option B time : 20 second
Thq so much sir
Only one minit time
Answer =B
I m b.c.a student 1 year
Option: B is correct - triangle a,b,c
Thank you sir👍🏻
Thankyou sir. Wonderful teaching
e sun thanks sir .. accha parhate ho app
Sir aap ne itna achha padhaya hai ki ans 2 sec main mil gaya. answer B
Thank you sir for such a wonder explanation.
answer B...
Thank you sir❤️😊
Sir Your explanation is very nice.
Answer:
It will have 3 vertices..and only this fact can give the answer . Additionally, no self loops will be there as diagonals are 0 and no multi edges bcoz all non diagonals are 1 .
Nice teaching sir
Thank you sir !! Helpful
option B . took only 0.5seconds to answer. thanks alot sir.
Thanks for the help 🙂
last question answer is option B (ABC )
time taken: 25 seconds.
Thank you sir🥰
really good explanation sir!!
Sir Option B is the correct answer
Sir,
option B is correct and I take few second to draw this graph.🙂🙂🙂
B option is correct and I take 30 second to solve this question.thank you soo much sir
Thank-you sir I'm preparing for Gate exam
Kaun sa year hai bhai aapka engineering ka
Sir please make lectures on Numerical Analysis
Your Kindness ❤️
Option B is right answer of this problem.
Thank you sir 😊
Thank you so much sir great explanation 😊😊
I just want to say thankyou so much sir!!
Ans is B . and it took me 24 seconds on paper to get the ans .
Thank you sir
Thanks, you made it look easy.
real
Please keep on this course
5:23 how sir , the only adjacency matrix includes 1 when (Vi , Vj) is edges & 0 otherwise.
Explain any of you know
13:00 D aur B self loop hai to 2 nai aayega ?
Nahi. Qki ye adjacency matrix hai na. Wo incidence me hota hai
sir the correct ans is "b" , took me 10 sec , thank you .
Thanks sir please make more videos on graph theory
I am watching this video in 2x speed & his multiple chants of 'Sun' sound Lehsun to me🤣🤣🤣
(17.13 )agar 1 self loop ho usko 2 count krenge ,,, par v3 me self loop 2 bar tha to 4 lenge na- waha v 2 liya gaya plz explain !?
last ques ans B
Very helpful for jam
Sir, which textbook do u recommend for engineering mathematics
Spectrum
Thank you sir B answer is right,1m
Option B.. 1min. Thnkuu so much sir
sir aur multiedge me kya value ayegi at 7:55?
Sir adjancey matrix me A or A²,A³ ki value change kaise hui 1 ka square to 1 hi hota h na
Thank you sir
Option B thank you sir 😊
Hello sir
Sir R-module pe video bnaie sir plzz
Super sir 🔥
Option B is the answer
Thank You Sir
Self lup me 1 count karte hai ya 2
1
king sir, you are a gem
Permutation of any two rows and columns gived us two isomorphic graph. How?
Proud of u sir 👏👏❤
Sir adjency matrix 2 qution you have wronged in last step b matrix c is 2 you have written and then e mateix c also 2 you have to write sir but you have written 1 why
Thanks a lot sir
ans of the question is b.........triangle one 🤗🤗
Sir plz make video on Theory of real function
Sir incidence matrix vale ques mai directed graph vala bhi example bta do usme 0 ki jgh -1 ata hai kya
00:02 Matrix representation of a graph in graph theory
01:55 Matrix representation of graph in graph theory
05:04 Matrix representation of the graph in Graph Theory.
06:42 Matrix representation of a graph summarizes the connections between vertices.
09:54 Calculating the incident matrix in Graph Theory
11:32 The video discusses graph theory and matrix representation of graphs.
14:54 Matrix representation of a graph in graph theory
16:27 Matrix representation of the graph shows the connections between vertices
19:30 The matrix representation of a graph in graph theory
Puneet superstar is that you?
where is the lecture sheet sir???
12:44 why have we taken the b only 1 where as we taken 2 in previous examples is that because the directional graph? plz tell me
Yes
Thank you so much sir 🙏🙏🙏
Thanks SIR ❤❤❤❤
🙏🙏🙏🙏🙏
19:53 - Option (B) time approx - 10 seconds
Sir last Q Ko sol kea Hy
Solution: option *B* is the correct option...