Types of Simple Graph | Special Graphs
ฝัง
- เผยแพร่เมื่อ 21 ต.ค. 2024
- #typesofGraph#specialGraph#graphtheory
👉Subscribe to our new channel: / @varunainashots
Null Graph: A graph with n vertices and zero edges is Null Graph.
Cyclic Graph: The cycle graph is a simple graph with n vertices {V1 V2 V3...Vn} and edges {V1,V2},
{V2, V3}, {V3, V4},....{Vn-1, Vn}, {Vn, V1}
Bipartite Graph: A graph G={V1 E} is bipartite if the vertex set can be partitioned into to sets V1 and V2 such that every edge is in between a vertex of V1 to V2.
Complete Bipartite Graph: A bipartite graph in which every vertex in V1 is adjacent to every vertex in V2 set.
►Graph Theory (Complete Playlist):
• Graph Theory
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Operating System:
• Operating System (Comp...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Computer Architecture :
• Computer Organization ...
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on TH-cam: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
Q1 = B option
Q2 = n2/4 19^2/4 90.25 we have to take floor value so 90 (A)
Simply awesome...itni clarity k sath smjhate hain sir😊
That last note about degree depending on other vertex set vertices was awesome
youtube have few teachers only on which we learners can trust .sir you are one of them .thankxx a lot sir for evrything
The way you make the topic easier and clear, that is awesome 👌Sir
That's good that you have added questions in the end
to test our understanding ability
ans 1 . option b a complete graph with even vertices is bi partite as we can partition them into 2 sets such that no two vertices in the same set have an edge between them
2. ans 2 answer floor 19*19/4 = 90 so ans is 90
lovely video also questions added at last is a good idea to test whether we understand the concept or not .thanks keep uploading keep motivating , also could you please kindly upload a video regarding gate2019 correct answers thanks
How many edges will be there in set v1 and v2 in question1 for option b
@@aryan2228 since its a cyclic graph both the set will have equal number of vertices
2nd one wrong formulae right answer haha
@@novaegionformula bhi right hai or answer bhi chutiye
Sir thank you for the wonderful explanation, it's my humble request to make videos on Graphs topic from Data Structures separately and also on Graphs of Algorithms separately
Time stamps
1:14 Null graph
2:27 cyclic graph
4:16 Bipartite graph
Respected sir,i learned a lot from you..i have to give gate 2019 but unfortunately i missed my gate exam.i am from Srinagar Kashmir,due to bad weather,the only road which connects Kashmir to rest of india was blocked due to which i didn't reach on time in the exam hall.. Now i want to give gate exam in 2020,plz sir made more nd more video sothat we may score more
Sir please start series on optimization and LPP as it is there in the syllabus of NTA UGC NET. I hope many people will be advantageous in that case. U are doing great job. Thank u so much. 😊
Kudos Sir, you are doing great job. I have learnt alot from you, God bless you :)
I am addicted to your videos.❤️
Could you please upload more videos regarding spanning trees ,binary trees and methods to find minimal spanning trees.
Finally i understand the Bigraph from your video.....After too much struggle .
Sir ap kmal k teacher h boht acha smjhaty h
Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏
my reason behind passing in gtu is this channel
Apki videos amazing h.. 💯🙌
answer should be 90 for maximum number of edges for a bipartitie graph with 19 vertices
Yup
Very nice explaination sir thank you so much
12:52 a) 90
Q-(1).
(A) - False.
(B) - True.
(C) - True. ( becoz of self loop)
(D) - False.
Q-(2).
Ans - 90.
1st method : by formula - lower value of N^2/4.
2nd method :
1st case : 9 × 9 = 81.
2nd case : 9 × 1 = 9.
Total : 81 + 9 = 90 Edges.
No, Q1)C) False.
There's no self loop in a null graph.
can you please elaborate q1. i am not getting how option b is true
@@priyankakalra8584 I might be late to reply...but the rule of bipartite is the number of vertices need to be divided equally,ie vertex set which is even is made into 2 sets, it's ALWAYS Bipartite, not in the case of odd , tho
Sir you are a legendary
thx sir....blessed to hv ur lectures...plz cover ugc net cs syllabus..
which of the following is true ? ans - a cyclic graph with even vertices is always bipartite.
Q1) B) A cyclic graph with even vertices is always bipartrate.
As it can always be partitioned into two sets of vertices having edges only to each other.
Q2) A) 90
E(max) = ⌊n² / 4⌋
Number of maximum edges = ⌊19² / 4 ⌋ = ⌊361 / 4⌋ = 90
Now i come to know that this is bipartite graph after too much struggle 👍👍
For some people its complete graph😄
@@GateSmashers i mean bipartite portion only😂👍
Sir u r the best
Thank you sir...
90 possible edges in bipartite graph
1-b and 2-a(90)
1 -> option B
2-> option A
sir in bipartite graph we are taking two set of vertices say V1 and V2 then V1 or V2 which contains vertices but not adjacent to its own set vertices but other set vertices then can we say that the V1 and V2 are the null graphs????????
Sir plz make video on euler graph and Hamilton graph
Thank u so much sir 😊
Option A. 90 edges
Thanks sir g 👍
Sir G null graph aur Empty graph do alag concepts hai...aapne empty graph ki definition null graph ko di
1)Ans B
2)Ans A = 90
Thank you Sir🙏🙏🙏
1 - B
2 - A 90
why is it that i watch your videos and feel like why i did not visit this channel before? I mean when i watch other channels, i understand very less but opposite happens here.
thanks
Thank You Sir for This Wonderful Explanation
Answers
1) Only B is True
2) 90
What is difference between bipartite and complete bipartite?
If one vertex is not used in both sets then it will be considered bipartite but not in complete bipartite
Thanku sir🙏
1-b
2-a
Sir please aap ik video mathmatics discreet structure ki per unit par most important questions ki bna dijiye
a ) True b) false c) false d) false Q : 90 is it correct sir
❤❤❤
Q1.(b), Q2. (a)
Q1-b
Q2-a
First question ,option Second and second question answer is 90
Sir graph ka theorem Playlist kijiye nah
Answer 1 - d
2 - a
Answers
B cylic graph of even degre is bipartite
A. 90
1: A-F,B-T, C-F,D-F 2: 90
1st ans. a,c,d is incorrect and opsition b is correct in some condition but not always
2nd ans. 90
Option A-90
thnk u sirrrrrr
Those who came only to know about bipartite graphs can skip straight to 4:20
Q1)C
Q2)A
Sir ky aap online classes leti hai agr nhe leti please meri online class li jie please🙏 mai maths mai bht week ho please🙏
Cyclic graph will be directed or undirected
Sir please make a video on line and chordal graphs 😢
Q1 answer option 2
B & A..... correct option
Option (B) is true
koi first question kas answer bataega with explanation jo sir ne end me pucha hai pls
Do you have a video on Quotient graph?
Great ❤
In the second question answer will be 180
Ans -2(91)
sir plz make videos on algo and computer organization
ans1= (B) true
ans2= 90
Last minute pdhai apke channel se
option B
B and 90
Sir the both answer is A
Please reply me
what is the answer to the questions?
is this playlist covered whole syllabus of GATE CS from graph theory?
No
Q2 90
Sir start karo Cyber security chapter na video
1----A and B are true
C and D false
2----90 will be correct answer
Self referential note:
Walk : Vertex✓, Edge ✓
Trail : Vertex✓, Edge × ; Closed Trail aka Circuit
Path : Vertex × (Except 1st and last Vertex) ; Closed Path aka Cycle
Q1. Option C is correct (verified from geeksforgeeks)
Q2. Option D is correct
Very dedicated
Option d or a
B,90 ANS.
defination of bipartitie:inplace of" to "there should be" TWO"
Middle finger mam and f u
Sir tell the answer please... timing 12:35
Ans2: 90
Nice
Question answer???plzz
Sir ap next video mein ans telly kra dya kre
No of edges= 90
Sir, I have a question
Is a graph having 4 vertices and 5 edges a planar graph ?? If so how ?
The four options are false
i guess even cycle graph can is bipartite
91 is the answer
anyone please tell answer of 1st ques. m not getting it
Can anyone please explain me why the option b is correct in question 1 ?
Let's get An example.
See of you have 2 set of vertices.
In va set you have 2 vertex
And in set 2 you have 2 vertex. you have to connect those 2 set in bipartite graph. And now you can see 1 number of vertex is connected with other 2 vertex (set 2). Now you have check the cycle graph. That is why option B is correct.
If you understand thank you.
If you don't understand i am sorry.
Pta nhi kyun vertex ko edge or edge ko vertex bolte hain?
can null graph be called 0-regular graph?