edited by
2,807 views

2 Answers

Best answer
12 votes
12 votes

Assuming only simple graphs (no self loops, multiple edges)

let n=4.

B)Disconnected

selected by
1 votes
1 votes
B.Disconnected...
edited by
Answer:

Related questions

7 votes
7 votes
2 answers
1
go_editor asked Jun 10, 2016
3,653 views
Let $X$ be the adjacency matrix of a graph $G$ with no self loops. The entries along the principal diagonal of $X$ areall zerosall onesboth zeros and onesdifferent
8 votes
8 votes
2 answers
2
go_editor asked Jun 10, 2016
3,945 views
If a graph requires $k$ different colours for its proper colouring, then the chromatic number of the graph is$1$$k$$k-1$$k/2$