The Gateway to Computer Science Excellence
+1 vote

Consider the graph given below as :

Which one of the following graph is isomorphic to the above graph ? 

in Graph Theory by Boss (30.1k points)
edited by | 1.2k views

1 Answer

+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
by Active (3.5k points)
C is the ans. Becz it has 12 edges which is equal to above graph edges
yes, of course equality of number edges is one of the criterion for showing isomorphish, also we have to take into account degree sequence

Related questions

Quick search syntax
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
50,647 questions
56,466 answers
100,311 users