edited by
1,193 views

1 Answer

1 votes
1 votes

There are 4 non-isomorphic simple graphs are there with five vertices and three edges

Related questions

0 votes
0 votes
0 answers
1
1 votes
1 votes
1 answer
2
0 votes
0 votes
1 answer
3
Mk Utkarsh asked Mar 1, 2018
2,455 views
How much storage is needed to represent a simple graph with n vertices and m edges using.a) adjacency lists?b) an adjacency matrix?c) an incidence matrix?
2 votes
2 votes
0 answers
4
reena_kandari asked Aug 8, 2017
1,213 views
Find the number of paths of length n between two different vertices in K4 if n isa) 2. b) 3. c) 4. d) 5.