ace mock test

tejas dadhe asked Feb 6, 2017

598 views

1 votes

Is this solution wrong?

tejas dadhe asked Feb 6, 2017

tejas dadhe

598 views

See all

2 2 Comments

Habibkhan

commented Feb 6, 2017

Another erroneous solution by ace..:) Yes bro 9 is correct..

1 votes

nitish

commented Sep 7, 2017

Kinldy Ignore the question as it is incomplete

0 votes

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

0 votes

A-D+D-B+D+E+E-C+E-F=9 is correct bro here even B-E is not mentioned many errors are there in ACe and Madeeasy

aik138463 answered Sep 7, 2017

aik138463

See all

0 Please log in or register to add a comment.

0 votes

Add all the costs it will sum to 9

Krishankant Ray answered Sep 7, 2017

Krishankant Ray

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

← Previous Next →

← Previous in category Next in category →

Related questions

0 votes

2 answers

yuuchan asked Jul 22, 2023

531 views

Ace workbook: If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____

If G is a complete bipartite graph with n vertices (n >= 2) and minimum number of edges, then matching number of G is ____1n-1⌊n/2⌋⌈n/2⌉

yuuchan

531 views

yuuchan asked Jul 22, 2023

Graph Theory
graph-theory
engineering-mathematics

+ –

4 votes

3 answers

`JEET asked May 26, 2019

1,141 views

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

`JEET

1.1k views

`JEET asked May 26, 2019

Graph Theory
graph-theory
ace-booklet

+ –

2 votes

3 answers

`JEET asked May 26, 2019

1,873 views

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

`JEET

1.9k views

`JEET asked May 26, 2019

Graph Theory
graph-theory
ace-booklet

+ –

3 votes

1 answer

`JEET asked May 26, 2019

654 views

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

`JEET

654 views

`JEET asked May 26, 2019

Graph Theory
graph-theory
discrete-mathematics
ace-booklet

+ –

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

2 2 Comments reply

Please log in or register to add a comment.

Please log in or register to answer this question.

2 Answers

0 reply

Please log in or register to add a comment.

0 reply

Please log in or register to add a comment.

Related questions

2 2 Comments

0

0