394 views
0 votes
0 votes

Doubt in 2nd and 3rd ....

Please log in or register to answer this question.

Related questions

375
views
1 answers
0 votes
jatin saini asked Mar 21, 2017
375 views
Determine all non- isomorphic graphs with the number of vertices 20 and edges 188.
308
views
1 answers
0 votes
cse23 asked Jan 20, 2017
308 views
A graph has a degree sequence <1,1,2,2,3,3,3,3> the number of edges in the graph?a) 18 b)9 c)36 d)8
244
views
1 answers
0 votes
Sachin886 asked May 22
244 views
For any undirected connected graph \( G \), let \( \chi(G) \) be the minimum number of colours needed to colour all the vertices of \( G \) in such a way that no two adjacent ... i}, v_{i+1}\right) \) is an edge for \( 1 \leq i \leq k \)
106
views
0 answers
0 votes