Register

maths_mock_test2

481 views

2 Answers

Best answer
3 votes
3 votes
Every element in an equivalent partition is related to each other- so the subgraph of an equivalent partition must be complete. So, for each partition we get a clique and all these cliques are mutually disconnected.
• selected by
User Avatar
0 votes
0 votes
I think ans will be d

 It maynot be bothway directed....so cannot say strongly connected. so a is wrong

may not all are unidirection so b is also wrong

and also not complete subgraph....so C is also wrong
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
suvasish114 asked 3 days ago
39 views
ISI kolkata MTech CS 2019
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths from $u$ to $v$ that do not contain the vertex $w$.
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths fro...
User Avatar
0 votes
0 votes
1 answer
2
Akash Chakraborty asked Mar 30
98 views
Practice Material Question
If G is a connected graph with 6 vertices and maximum number of edges, then which of the following is true ? (a) Euler path exists, but Euler circuit does not exist in G. (b) Only Euler path exists in G. (c) Euler circuit does not exists in G (d) G is not traversable.
If G is a connected graph with 6 vertices and maximum number of edges, then which of the following is true ? (a) Euler path exists, but Euler circuit does not exist in G....
User Avatar
2 votes
2 votes
2 answers
3
Arjun asked Feb 16
2,821 views
GATE CSE 2024 | Set 2 | Question: 7
​​​​Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements is always TRUE? $\text{G}$ is a cycle $\text{G}$ is a perfect matching $\text{G}$ is a complete graph There is no such graph $\text{G}$
​​​​Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements i...
User Avatar
1 votes
1 votes
3 answers
4
Arjun asked Feb 16
1,877 views
GATE CSE 2024 | Set 2 | Question: 50
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
The chromatic number of a graph is the minimum number of colours used in a proper colouring of the graph. The chromatic number of the following graph is __________.
User Avatar
Link Copied!