Recent activity by chandan2teja / GATE Overflow for GATE CSE

2 answers

1

#ACE_ACADEMY_DISCRETE_MATHS_BOOKLET.
Which of the following is not true? (a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$ (b) If $G$ is a simple graph with $6$ vertices and the degree of each vertex is at least $3$, then the Hamiltonian cycle exists in ... simple graph with $5$ vertices and $7$ edges, then the Hamiltonian cycle exists in $G$ Please help me understand all the options.

Which of the following is not true?(a) Number of edge-disjoint Hamiltonian cycles in $K_7$ is $3$(b) If $G$ is a simple graph with $6$ vertices and the degree of each ver...

2.7k views

commented Sep 8, 2019

2 answers

2

Gray Code (Self Doubt)
Was solving the GO 2019 pdf when I encountered this question asked in TIFR 2017. Although I have understood this question, I have one doubt- It is mentioned in the question that for a 3-bit number, the ordering (000, 100, 101, 111, 110, 010, 011, 001) is one of the possible Gray codes. Then, how many such orders are there for an n-bit number?

Was solving the GO 2019 pdf when I encountered this question asked in TIFR 2017. Although I have understood this question, I have one doubt-It is mentioned in the questio...

1.5k views

commented Jun 18, 2019

1 answer

3

ACE ACADEMY BOOKLET
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Hamiltonian cycle exists for all n. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Hamiltonian cycle exists $\Leftrightarrow$ ... Hamiltonian cycle exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Hamiltonian cycle exits $\Leftrightarrow$ $n$ is even.

Which of the following is $\textbf{not}$ TRUE?(a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Hamiltonian cycle exists for all n.(b) In a complete bipartite graph $K_{m,n...

655 views

answered Jun 4, 2019

3 answers

4

Ace academy booklet #graph theory
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Euler circuit exists ... Euler circuit exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.

Which of the following is $\textbf{not}$ TRUE?(a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd.(b) In a complete bipartit...

1.9k views

answered Jun 4, 2019

0 answers

5

Ace booklet functions page:152 q.no 44
Let A, B, C are k element sets and let S be an n element set where k<=n. How many triples of functions f:A->S, g:B->S, h:C->S are there such that f, g and h are all injective and f(A) =g(B) =h(C) =?

Let A, B, C are k element sets and let S be an n element set where k<=n. How many triples of functions f:A->S, g:B->S, h:C->S are there such that f, g and h are all injec...

213 views

asked May 27, 2019

3 answers

6

ACE ACADEMY BOOKLET QUESTION
Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping subsets $S$ and $T$. Which of the following is true? There are at least two edges that ... $S$ and one end point in $T$ There are exactly one edge that have one end point in $S$ and one end point in $T$

Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping su...

1.1k views

answered May 27, 2019

0 answers

7

Ace workbook lattice concept
If X is minimum element of S then X is related to y for all y belongs to S. Let [S;R] be a poset. If every non empty subset of S has a minimum element then a) S is Totally ordered set b) S is bounded set. C) S is complemented ... then 1 will be part of every non empty subset of S. Is this correct way of interpreting the question. If not can you please elaborate it

If X is minimum element of S then X is related to y for all y belongs to S. Let [S;R] be a poset. If every non empty subset of S has a minimum element thena) S is Totally...

235 views

asked May 26, 2019

2 answers

8

ACE Workbook:
ACE Workbook: Q) Let G be a simple graph(connected) with minimum number of edges. If G has n vertices with degree-1,2 vertices of degree 2, 4 vertices of degree 3 and 3 vertices of degree-4, then value of n is ? Can anyone give the answer and how to approach these problems. Thanks in advance.

ACE Workbook:Q) Let G be a simple graph(connected) with minimum number of edges. If G has n vertices with degree-1,2 vertices of degree 2, 4 vertices of degree 3 and 3 ve...

1.0k views

commented May 13, 2019

6 answers

9

GATE CSE 2006 | Question: 72
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The maximum degree of a vertex in $G$ is: $\binom{\frac{n}{2}}{2}.2^{\frac{n}{2}}$ $2^{n-2}$ $2^{n-3}\times 3$ $2^{n-1}$

The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets...

17.8k views

commented May 13, 2019

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true