Representations of Graph | Adjacency matrix | Incidence matrix | Adjacency list
Вставка
- Опубліковано 25 гру 2024
- #representationsofgraph #adjacencymatrix #incidencematrix #adjacencylist #graphrepresentation
Playlist :-
Set Theory
• Set Theory Playlist | ...
Relation
• Relation playlist in D...
Boolean Algebra
• Boolean Algebra playli...
Function
• Function playlist in d...
Lattice and POSet
• Poset | Hasse | Lattic...
Graph Theory
• Graph Theory playlist ...
Group Theory
• Playlist Group Theory ...
Matrix and Determinants
• Matrix playlist | Disc...
Mathematical Logic-Proposition
• Playlist Proposition |...
Thanks a lot sir...for your all hardwork and efforts 👍🤟🙏🙏
Really helpful and easy to understand
understood in 2 minutes very helpful , deserve a follow
6x me dekhe kya
Superb explanation fan of u . Tommorow is my exam and this video helped me a lot......
this video very helpful sir I have no words for ur praise ❤🔥❤🔥❤🔥❤🔥
thank you,sir.Love from Bangladesh
00:02 Graph representation explored using Adjacency Matrix, Incidence Matrix, and Adjacency List.
01:05 Creating adjacency matrix for graph representation
02:35 Explanation of adjacency matrix in graph representations
04:11 Introduction to Graph Representations
05:23 Representation of Graph using matrices
07:24 Representations of Graph
09:10 Understanding adjacency list representation
10:47 Explanation of adjacency list in graph representation
Thanks brother..... Iam late but this video helps me alot 🥺
Sir,you explain all topic very nicely and easily 👌
Thank you so much
really very well explained . easy to understand
Sir, you have prepared very well or in a very easy way, sir, you are very nice, you are very nice soror 🤭🤭🤭🤭🤭😊
Thanks 11:49
Thanku so much ..sir .your vdo seriously very help fully
Thankyou sir..... Amazing explanation
Thanku sir for this topic easily taught ❤😊
Clear about this by this video 🙏😊
Thnx sir for making this great video
😊🎉🎉
Thank you sir☺aapne concept clear kar diya
Thank you so much sir it's very informative 👍❤️💗
It's really help us a lot🙏means a lot sir
Thanks sir ..... love frm kashmir ❤❤❤❤
Best lecture ❤❤
Thank you.
Thank you so much Sir .... Behtreen explanation ❤
Very easy understanding
Thank you sir
JazakAllah kahira ❤❤❤
bahut bdya❤❤
Explained very well...
Very helpful sir😊....get in 2 minutes😊
Thank u sir more useful for exam time
Wonderful
Thank you😊
i got it in one shot thanks sir
SIR THIS VIDEO IS VERY HELPFULL FOR ME
Thanks sir ji ❤❤❤❤
Today my exam...
You save my semester 😂
Thanku❤
Thanks for nyc explain
Good teaching sir🎉🎉
Thank you😊
Thnx alots sir ❤ ur explained is too easy❤🎉
Thank you so much 😊
Love this video ❤❤
Nice explanation
Saved my life
Baut acha lagraha hey sir 🥰
Best explanation ❤️
Thanku so much sir😊
you explained well bro
Bahut shukriya 🎉
Thanks you Clear and cut
thank you so much sir for this support;
Thanks a lot sir,✨🙏
Thank you so much sir.
Thank you so much sir yaar 😁
Sir ek question hai agar question mein direct adjacency matrix diya hua ho aur usme se humko bole graph draw krne ke liye toh hum adjacency matrix ke case mein dono graph banaenge kya ? Hum ko kaise pta chalega directed graph bnana hai ya undirected adjacency matrix ke case me ? Please sir answer it.
All clearr ❤
It only work directed grahp and undirected these methods . please tell me answer .
Thanks a lot
very wll thanks sir
Sir only if graph containing loop would be there in the video. It would be more clear to us.
Bro storage representation ke liye adjacency use kasise karte hai
🙏🙏 thankyou 🥰✨ sir 🙏
Welcome
Thank u sir😊
Sir can you tell us if there is loop for a vertice in undirected adjanency list is (a,b,c)????
Sir, agar adjacent list mai self loop hoga fir kya voh bhii adjacent list mai mentioned hoga jase apne a ka b,c likha agar loop hoga kya a,b,c hoga
Self loop ho tb bhi 1 ki entry hogi
Just missing loops, other than that thank you ❤.
Thank you sir☺️
Welcome,,, keep watching
Thanks sir 😀
Welcome
Video me 10:10 wale time pe aapne
Bola
ABD toh mujhe Devilliers ki yaad
Aa gai😁
What happen if self loops are in vertices
To 1 aa jayega usk liye bhi
Thanks
Welcome
Thank you sir :)
Welcome
Thanks you sir ji
Welcome
hello sir their is one doubt
in adjacency matrix if their is any self loop how many time it is calculated and
in Incidence matrix how many times it is calculated
i have saw in another video they said that for adjacency matrix we should calculate as 2
and for incidence matrix we should calculate for 1
please answer my question sir
aisa bhi h kya?
Self loop one time hee calculate hoga
Matrix 0 & 1 ki form me present hogi.
only Adjancency Matrix me Parallel Edges 2 time count hongi (depends on the number of parallel edges)
Thank u sir
Welcome
Exam me Definition and Graph draw karna hota he only ?
Old question paper k review kr lijiye
thanku
Sir, can you tell me we have to explain this way when we will solve any question in exam paper. Can you define how to write any solution in exam paper right way .
Namasker
Discrete mathematics ke or lecture daliye please sir🙂
studio.ua-cam.com/channels/dm2GZSkZZh824PppaMxi4Q.htmlplaylists
Click on above link ,there are many playlist available on discrete mathematics.
10/10 rating
Tqq
Welcome..Pls like , share and subscribe my channel.
I love u sir ummaaaa i miss u
😊😊
❤
👍👍
Thori see theory b shamil b kr liya kraa
Aap email id de dijiye, me theory send kr duga
@@SandeepKumarGour okay
well explained, much batter if u use white board instead of paper,,,,,,,,,,,,,,,,,,,,,
Achha kam kye ho
Bahut achha samjhate hai sir
Contact no give me please
thanks sir best explaination
Thanks sir ☺️
Thanks Sir
Wonderful
Thank you sir
Thanks
tq
Thank you so much sir
Thank u so much sir 😊
Welcome
Thank you so much sir .
Thank you sir 😊
Thank you so much Sir