Question: How many non isomorphic connected simple graphs are there with n vertices when n is a) 2? b) 3? c) 4? d) 5?
a) 2?
b) 3?
c) 4?
d) 5?
Step by Step Solution
3.38 Rating (170 Votes )
There are 3 Steps involved in it
We have to enumerate carefully all the possibilities a There is obviously only 1 namely K 2 the grap... View full answer
Get step-by-step solutions from verified subject matter experts
Document Format (1 attachment)
923-M-C-M-S (2370).docx
120 KBs Word File
