Recent questions tagged goclasses-graph-theory-practice-questions

The minimum number of edges in a connected graph with ${ }^{\prime} n^{\prime}$ vertices is equal to$n(n-1)$ $\frac{n(n-1)}{2}$ $n^2$ $n-1$

The number of edges in a complete graph of $n$ vertices is$n$ $n(n-1) / 2$ $n(n+1) / 2$ $\left(n^{\wedge} 2\right) / 2$

A graph is $d$ - regular if every vertex has degree $d$. For a $d$ - regular graph on $n$ vertices, which of the following must be TRUE?$d$ divides $n$At least one of $d$...

An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices areAll of even degreeAll of odd degreeOf any degreeEven in number

Let $G=(V, E)$ be an undirected simple graph. A subset $M \subseteq E$ is a matching in $G$ if distinct edges in $M$ do not share a vertex. A matching is maximal if no st...

The number of colours required to properly colour the vertices of every planer graph is$2$ $3$ $4$ $5$

The graph $K$$3$,$4$ has:A. $3$ edgesB. $4$ edgesC. $7$ edgesD. $12$ edges

Let $K_n$ be the complete graph on $n$ vertices labeled $\{1,2, \ldots, n\}$ with $m=\frac{n(n-1)}{2}$ edges. What is the number of spanning trees of $K_n$ ?$\frac{m}{n-1...

In a graph, the degree of a vertex is the number of edges incident (connected) on it. Which of the following is true for every graph $G$ ?There are even number of vertice...

Which of the following graphs are bipartite$?$Only ($1$) Only ($2$) Only ($2$) and ($3$) None of ($1$), ($2$), ($3$)

How many of the following statements are correct?1. All cyclic graphs are complete graphs.2. All complete graphs are cyclic graphs.3. All paths are bipartite.4. All cycli...

If G is the forest with 54 vertices and 17 connected components, then number of edges in G is ?$37$$71$$17$$54$

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...

What is the maximum number of edges in a bipartite graph having 12 vertices.$24$$38$$36$$32$

 How many of the following given set of vertices is/are CORRECT strongly connected components for the given directed graph?$C$$A$$E$$IC$$F$$IDE$$I$$H$$GJ$

Determine which pairs of graphs below are isomorphic.A and BA and CB and CNone of these