Register

ace mock test

1,017 views
1 1 vote

Is this solution wrong?

2 Answers

0 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
Voting & Accepting an answer helps improve the community
← Previous · Any suggestions for ...Next → · MadeEasy Subject Tes...
← Previous in category · Dirac TheoremNext in category → · Graph Theory (Chroma...
Position:
Show:

Related questions

0 0 votes
2 answers 2 answers
1.3k
1.3k views
yuuchan asked Jul 22, 2023
1,288 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⌉
5 5 votes
3 answers 3 answers
1.9k
1.9k views
`JEET asked May 26, 2019
1,943 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 su...
2 2 votes
3 answers 3 answers
2.5k
2.5k views
`JEET asked May 26, 2019
2,526 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 bipartit...
3 3 votes
1 1 answer
1.0k
1.0k views
`JEET asked May 26, 2019
1,028 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...