1 Crore+ students have signed up on EduRev. Have you? Download the App 
Let G be an arbitrary graph with n nodes and k components. If a vertex is removed from G, the number of components in the resultant graph must necessarily lie between.
How many perfect matchings are there in a complete graph of 6 vertices?
A Graph G = (V, E) satisfies E ≤ 3 V  6. The mindegree of G is defined as
Therefore, mindegree of G cannot be
What is the number of vertices in an undirected connected graph with 27 edges, 6 vertices of degree 2, 3 vertices of degree 4 and remaining of degree 3?
G is a simple, connected, undirected graph. Some vertices of G are of odd degree. Add a node v to G and make it adjacent to each odd degree vertex of G. The resultant graph is sure to be
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph?
Which of the following statements is/are TRUE for undirected graph?
P: Number of odd degree vertices is even.
Q: Sum of degrees of all vertices is even.
An ordered ntuple (d_{1}, d_{2}, .... d_{n}) with d_{1} ≥ d_{2 }≥ ... ≥ d_{n} is called graphic if there exists a simple undirected graph with n vertices having degrees d_{1}, d_{2}, ..., d_{n} respectively. Which of the following 6tuples is NOT graphic?
If G is a forest with nvertices and k connected components, how many edges does G have?
23 docs285 tests

23 docs285 tests
