Recent questions tagged goclasses-dm-practice-questions

Does there exist a simple Eulerian graph on 6 vertices and 7 edges.Enter $1$ for Yes and $0$ for No.

Does the following graph have a Hamiltonian cycle? Enter $1$ for Yes and $0$ for No.  

Is the following graph Hamiltonian? Enter $1$ for Yes and $0$ for No.

Does there exist a graph with the following degree sequence:$$3,3,3,3,5,6,6,6,6,6,6$$Enter $1$ Yes and $0$ for No

If $G$ be a simple graph on $n$ vertices with $\Delta(G)=\left\lceil\frac{n}{2}\right\rceil$ and $\delta(G)=\left\lfloor\frac{n}{2}\right\rfloor-1$, then$G$ is connected ...

A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is3456

Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even.P onlyQ onlyBoth P ...

For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?$v=e$$v=e+1$$v+1=e$$v=e-1$

Let $G_1$ and $G_2$ be two disjoint graphs having $p_1$ and $p_2$ vertices and $n_1$, $n_2$ edges respectively. Then the number of edges in $G_1 \vee G_2$ is$n_1+n_2$$n_1...

A vertex that is adjacent to exactly one other vertex is called a $\_\_\_\_$ vertex.IsolatedPendantIncidentSimple

Which of the following will be an upper bound for minimum degree of a graph with 10 vertices.9876

A graph is self complementary if it is isomorphic to it's complement.For all self complementary graphs on $n$ vertices, $n$ isA multiple of 4evenoddcongruent to $0 \bmod ...

A connected planar graph having 6 vertices, 7 edges contains $\_\_\_\_$ regions.1357

Which of the following is true for any simple connected graph with more than 2 vertices.No two vertices have same degreeAt least two vertices have same degreeAt least 3 v...

Total number of regular graphs of degree 2 on 12 vertices.6789

What is the regularity of $K_n$.$n$$n-1$01

What is the determinant of the adjacency matrix of $C_4$.1-10None of the graph

What is the maximum number of edges in a bipartite graph having 12 vertices.24383632

What is the number of edges present in complete graph $K_n$ having $n$ vertices.$\frac{n(n+1)}{2}$$\frac{n(n-1)}{2}$$n^2$None of the above

Which of the following statements for a simple graph is correct.Every trail is a pathEvery path is a trailpathPath and trail have no relation

If G is a 3-regular, connected, simple, planar graph with 18 vertices, then, the number of regions in G are ?10382011

Which of the following graphs is self-complementary?$\mathrm{C}_6$$\mathrm{P}_4$$\mathrm{P}_5$None of the above

Every graph has - - number of odd degree vertices.EvenZeroOddCannot say

Let e be the number of edges, v be the number of nodes and r be the number of regions of a planar graph. Then which of the following inequalities hold true?$3 e<2 r$$3 \m...

Which of the following graphs is NOT Hamiltonian?$K_n$$C_n$, cycle on $n$ vertices.$\mathrm{K}_{10,9}$.None of the above.

$K_{2,2}$ is isomorphic to $C_4$. (Enter $1$ for True and $0$ for False)

$\text { Chromatic number of hypercube graph } Q_3 \text { (shown in figure below) is : }$

How many edges are there in complement of $P_6$ (path on 6 vertices)?9510None of the above

Which of the following graphs is planar?$K_5$$K_{3,3}$$K_6$$K_4$

Let $K_{m, n}$ represent a complete bipartite graph, where m and n are positive integers. What is the chromatic number of this graph?nm12