Question: How many non isomorphic connected simple graphs are there with n vertices when n is a) 2? b) 3? c) 4? d) 5?

How many non isomorphic connected simple graphs are there with n vertices when n is
a) 2?
b) 3?
c) 4?
d) 5?

Step by Step Solution

3.38 Rating (170 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

We have to enumerate carefully all the possibilities a There is obviously only 1 namely K 2 the grap... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

923-M-C-M-S (2370).docx

120 KBs Word File

Students Have Also Explored These Related Statistics Questions!

Related Book