edited by
3,411 views

2 Answers

2 votes
2 votes
From given figure we can say that, every vertex has degree = 3,

in all options but C, graph has at least one vertex with degree = 4

so I think option C would be the correct answer
2 votes
2 votes
The given graph is Bipartite, 3-Regular graph on 8 vertices.

Also the given graph in the question is Hypercube graph on 8 vertices i.e. the given graph is $Q_3.$

Option C is $Q_3$, So option C is correct answer.

We can note that Graph in Option A,B,D have at least one vertex of degree 4, but in the given graph every vertex has degree 3, So, given graph is Not isomorphic to graph in option A,B,D.
Answer:

Related questions

42 votes
42 votes
6 answers
1
go_editor asked Sep 28, 2014
17,307 views
A cycle on $n$ vertices is isomorphic to its complement. The value of $n$ is _____.
1 votes
1 votes
2 answers
2
makhdoom ghaya asked Jun 27, 2016
6,984 views
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$$m = 2, n = 3$ $m = n 2$$m...
29 votes
29 votes
4 answers
3
Arjun asked Sep 25, 2014
10,970 views
Which of the following graphs is isomorphic to
0 votes
0 votes
1 answer
4