GATE CSE 2008 | Graph Theory Question 43 | Discrete Mathematics

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

$$G$$ is a graph on $$n$$ vertices and $$2n-2$$ edges. The edges of $$G$$ can be partitioned into two edge-disjoint spanning trees. Which of the following in NOT true for $$G$$?

For every subset of $$k$$ vertices, the induced subgraph has at most $$2k-2$$ edges

The minimum cut in $$G$$ has at least two edges

There are two edge-disjoint paths between every pair of vertices

There are two vertex-disjoint paths between every pair of vertices

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

A binary tree with $$n>1$$ nodes has $${n_1}$$, $${n_2}$$ and $${n_3}$$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours.

$${n_3}$$ can be expressed as:

$${n_1}$$ $$+$$ $${n_1}$$ $$-$$ $$1$$

$${n_1}$$ $$-$$ $$2$$

$$\left[ {{{{n_1} + {n_2}} \over 2}} \right]$$

$${n_2}$$ $$-$$ $$1$$

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

A binary tree with $$n>1$$ nodes has $${n_1}$$, $${n_2}$$ and $${n_3}$$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours.

Starting with the above tree, while there remains a node $$v$$ of degree two in the tree, add an edge between the two neighbours of $$v$$ and then remove $$v$$ from the tree. How many edges will remain at the end of the process?

$${2^ * }{n_1} - 3$$

$${n_2} + {2^ * }{n_1} - 2$$

$${n_3} - {n_2}$$

$${n_2} + {n_1} - 2$$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Which of the following graphs has an Eulerian circuit?

Any $$k$$-regular graph where $$k$$ is an even number.

A complete graph on 90 vertices.

The complement of a cycle on 25 vertices.

None of the above.