01:22 Graph Theory basics: Trees and Binary Trees 02:44 A tree has a root and branches, while a binary tree has a specific structure with one vertex of degree 2. 04:06 Binary tree and pendent vertices in trees 05:28 Spawning tree is a sub-graph of a connected graph that is a tree. 06:50 The video explains the concept of spawning trees in a complete graph of four vertices. 08:12 Graph Theory - Spanning Trees and Binary Trees 09:34 A tree has only one path between every pair of vertices and n vertices will have n-1 edges. 10:55 The path length of a given tree can be found by calculating the sum of distances from all pendent vertices. Crafted by Merlin AI.
🙏🙏Sir plz jaldi discrete mathematics ka all syllabus complete krayiye hamare exam aa rehe hai agle month se aur mathematics college mai bilkul samajh nahi ata hai🙏🙏
the example in the starting of the video is a binary tree because in binary tree each node must have at most two child which the given graph is satisfying and its not a root because the tree is not originating from that node
Sir with due respect, In Question 1 on spanning trees the total no. of spanning trees for complete graph of 4 vertices will be 16 Also we can prove it by the formula n^(n-2).
Sir in case of spanning tree u take the example to explain is a closed graph and in starting u told that the closed graph are not tree how it is tree plz explain sir
assalamualikum sir, right now i am studing in 3rd semester. but the reason why i am saying all this is i have 2 courses engineering mathmetics and discrete mathmetics...and i have been following you since the staring time of this semester...and i didnt need to watch any other teachers video..today its done THANK YOU SIR
suppose a tree has n1 vertices of degree 1,2 vertices of degree 2, 4 vertices of degree 3 and 3 vertices of degree 4 , find n1. Sir how i solve this ques ?
➡ Incase you missed previous Videos of Discrete Mathematics =
Playlist of Discrete Mathematics - ua-cam.com/play/PLU6SqdYcYsfJ27O0dvuMwafS3X8CecqUg.html
1
option a-1
Be patient and see all the class . Because he is one of my best teachers
makda
@@jayeshkumarsharma8775 😂😂
complete graph of 4 vertices will have 16 spanning tree as n^(n-2) is the formula for finding the no of spanning tree for n vertices.
absolutely correct👍
this sir doesnot teach in detail. he skips a lot
Great 👍
Bro n ki value m ky rakhna h vertex ki value
Is it 8
Order of pendent vertex in tree is
Option A: 1.
Thank you Sir 🔥🔥
how??
@@sujitrishikumar8621 pendent vertex can only have one connected edge so order is 1
@@bhargavvarma7694 so sir is simply asking for the degree ..
True
@@sujitrishikumar8621 one coz it is connected to only one vertex with a single edge
Thank you so much sir,, it's very helpful for me and also I got benifit of your digital electronics videos in my exam MSc Computer Science 💞
Apke chalate maths aassan lag rag raha hai, ❤ love you sir, next vedio continue
Sir aap aacha padhate ho please continue your videos 👍❤
This is the best video I have ever found on tree...helped me a lot.... thanku sir 😊
@Unlimited Beam ladki dekhi nhi hi
Great sir ...☺😇 thanks for making mathematics very simple .
Thanks sir for solving mathematics problem 🙏🙏🙏🙏
01:22 Graph Theory basics: Trees and Binary Trees
02:44 A tree has a root and branches, while a binary tree has a specific structure with one vertex of degree 2.
04:06 Binary tree and pendent vertices in trees
05:28 Spawning tree is a sub-graph of a connected graph that is a tree.
06:50 The video explains the concept of spawning trees in a complete graph of four vertices.
08:12 Graph Theory - Spanning Trees and Binary Trees
09:34 A tree has only one path between every pair of vertices and n vertices will have n-1 edges.
10:55 The path length of a given tree can be found by calculating the sum of distances from all pendent vertices.
Crafted by Merlin AI.
Bhut bhut dhanyavaad sir ji graph aur tree ko itni achi tarah samjhne ke liye🙏🙏🙏
10:27 Answer (A {1} )
10:55
Question:-order of pendent vertex in tree is ?
(A)1 ✅
I take 15 seconds to solve this
sir i want question practice lecture for semester exam
Thank you so much sir 😊 you are last min saviour❤🙏
Very nice teaching sir, please continue videos 🙏🙏🙏🙏🙏🙏🙏
Easily understand the concept of graph theory❤
It helps me in my semester
order of pendant vertex: 1
Answer: A) 1
time taken : 2-3 seconds
Thank you sir 🙏🏻
why ?? give reason to support your answer
@@tera_chadigarh_aala_jaat then what's the correct one?
Thank you so much sir ❤️🙏, very helpful video 🤗
Ans -(A)1
one coz it is connected to only one vertex with a single edge
सर की वजह से हम ने 1year निकली और अभी सेकेंड भी निकल रही है thanks sir 👣🙏
Thank you so much sir ♥️ i'm also waiting for this topic ...
Thank you so much Sir...for your help 🥰♥️... I'm waiting for your next lecture...plzz upload quickly 🥰♥️
Kya tum phele UA-cam video upload karti thi ?
❤❤❤❤
Thank you gp sir 🙏
Your channel is very helpful to Mee..❤
Sir ,I am waiting all videos for revision purpose ....
A lot of thanks ...Sir
Outstanding analysis ....
order of a pendent vertex in a tree is 1.
thank you sir for making mathematics very simple and easy..................
Option no A because pedent vertex means one degree of a vertex and also order of pendent vertex in tree mean no vertex in a tree
Order of pendent vertex is 1
Order or degree
Degree
Hi priyanka u r talking about degree right
@@suriharshul no... Vertex
Degree of vertex
Thank you sir 🔥
🙏🙏Sir plz jaldi discrete mathematics ka all syllabus complete krayiye hamare exam aa rehe hai agle month se aur mathematics college mai bilkul samajh nahi ata hai🙏🙏
Dhanyawad guruji ❤
Really thank you so much sir I helped a lot from this playlist
Thank you so much sir ❤
Order of pendent vertex in tree is
Option A: 1
comment so that sir will get notified that his videos are watched n streamed even after a long time
you are doing a great job sir hatts off to you ..
Nice lecture🙂🙂🙂🙂🙂🙂🙂🙂
the example in the starting of the video is a binary tree because in binary tree each node must have at most two child which the given graph is satisfying and its not a root because the tree is not originating from that node
Perfect sir👍👍
Ans is :- A 10:28
Because degree is 1.
Order of pendent vertex in Tree is : 1 .
the answer is 1(option-A) cause an pendent vertex is the last edge of an tree and it can be the end of the tree and hence so it is 1
bahut badiya samaj aa ra h sir thanks sir
Best Teacher everrr
Order of pendent vertex is 1.
1 hoga sir
❤️ From Kolkata
ohh i thought it has the same concept of trees as we studied in DSA but its a bit different ...
Great sir ji ❤️
Answer:1
Time:2 seconds
Thank you sir 🙏🏽
Very nice sir 🙏 🙏
sir the correct ans is "a" , thank you sir .
Sir upload next part of this topic
Thank you so much sir.
Thanks.
Thankyou sir 🙏🏻
option (a) will be right sir
Order of pendent vertex in tree is
Answer will be (c) 3 .
1
Because in a tree pendant vertex associate by one edge
Sir with due respect,
In Question 1 on spanning trees the total no. of spanning trees for complete graph of 4 vertices will be 16
Also we can prove it by the formula n^(n-2).
thank you sir , you da real goat
Ans-1
❤❤
Sir in question 1 we need 4 vertex graph you drawed 5 vertex graph
I think in the case of a Spanning tree of four vertices (complete), the total spanning trees will be 16, not 12!
Sir plz explain the degree base in topological indicies in chemical graph
I am always watch your vodies
@@mahnoormubeen9117 awesome videos ko "vodies" kar diya niceee
1 is the answer in this problem
Order of pendent vertex in tree is:1
Pendent vertex has degree 1. Time: 0.1 sec 🔥🔥
Thankyou so much sir
ans: 1 ////// time 1 sec
degree of pendent vertex : ans =1
Sir in case of spanning tree u take the example to explain is a closed graph and in starting u told that the closed graph are not tree how it is tree plz explain sir
Order of pendant vertex is 2
order of PV is 1 sir
question 1 me ans is 16, [ n^(n-2) ]
One
And Thankyou sir
nice question
Sir kindly graph duality and line graph, degree sequence of graph pay b video upload kar dein
16 spanning tree aayenge sir 4 vertex graph me
N^(N-2) where N is vertex
true bhai
Ans :- A) 1
Good afternoon sir 🙏🙏🙏
Order of pendent vertex in a tree is 1
Order of pendent vertiex in tree is
Option (c)=3
It should be one coz it is connected to only one vertex with a single edge
@@Naveenbanoth234 yes
@@Naveenbanoth234 truee
degree of pendent vertex is one
1,, Am I Right Sir
Thanku sir
Order of pendant vertex in a tree is 1 ✅️
assalamualikum sir, right now i am studing in 3rd semester. but the reason why i am saying all this is i have 2 courses engineering mathmetics and discrete mathmetics...and i have been following you since the staring time of this semester...and i didnt need to watch any other teachers video..today its done
THANK YOU SIR
Option A is currect ❤
Sir please make a video on Kuratowski's non planar theorem
order of pendent vertex is 1 because there is only one pendent vertex in tree
Sir tree is unit the Max and min cut topic pr video post karo please ..
Hamaari class test shuru ho gayi hai
B. Time 2sec.❤️👏
suppose a tree has n1 vertices of degree 1,2 vertices of degree 2, 4 vertices of degree 3 and 3 vertices of degree 4 , find n1.
Sir how i solve this ques ?
Sir a humble request can you please provide full detailed paid course for rajasthan second grade(tgt) teacher exams graduation part...
Plz sir
Answer _ 1option(A)
answer =1
Option A:,1 sir
Order of pendent vertex : 2
Time taken : 1 Second
No it's (A) : 1
Sir Polish notation par bhi video bna dijiye
last question answer : option A (1)
time taken 0.329347 sec
Order of pandent vertex is 1🤩