Get Advice on Live Video Call
Earn $ Cash $ with
consultations on Bissoy App

What is the number of vertices in an undirected connected graph with 39 edges, 7 vertices of degree 2, 2 vertices of degree 5 and remaining of degree 6?

Correct Answer: 18
We know that, sum of degree of all the vertices = 2 * number of edges 2*7 + 5*2 + 6*x = 39*2 x=9 Number of vertices = 7 + 2 + 9 = 18.

An undirected graph has 8 vertices labelled 1, 2, …,8 and 31 edges. Vertices 1, 3, 5, 7 have degree 8 and vertices 2, 4, 6, 8 have degree 7. What is the degree of vertex 8?

Let D be a simple graph on 10 vertices such that there is a vertex of degree 1, a vertex of degree 2, a vertex of degree 3, a vertex of degree 4, a vertex of degree 5, a vertex of degree 6, a vertex of degree 7, a vertex of degree 8 and a vertex of degree 9. What can be the degree of the last vertex?

G is a simple undirected graph and some vertices of G are of odd degree. Add a node n to G and make it adjacent to each odd degree vertex of G. The resultant graph is ______

G is an undirected graph with n vertices and 26 edges such that each vertex of G has a degree at least 4. Then the maximum possible value of n is ___________

If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is ___________

______ is the maximum number of edges in an acyclic undirected graph with k vertices.

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is ___________

Space complexity for an adjacency list of an undirected graph having large values of V (vertices) and E (edges) is __________

What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?

Any subset of edges that connects all the vertices and has minimum total weight, if all the edge weights of an undirected graph are positive is called _______