293 views

Related questions

0 votes
0 votes
1 answer
1
Crime Master Gogo asked May 3, 2017
2,953 views
Is every k connected graph is k-1 connected or the reverse? I always get confused. Can someone explain with the help of an example.
0 votes
0 votes
1 answer
2
shuham kumar asked Nov 18, 2022
391 views
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
2 votes
2 votes
1 answer
3
jugnu1337 asked Dec 17, 2021
515 views
complete directed graph with 8 vertices has 28 edges this statement is true or falseplese explain?
5 votes
5 votes
2 answers
4
Nidhi Budhraja asked Aug 26, 2018
2,380 views
Stmt 1: A simple graph is necessarily connected if |E| (n-1)*(n-2)/2.Stmt2: A simple graph with n vertices and k components has at least n-k edges.Can you please explain...