329 views
0 votes
0 votes
  • The number of labelled subgraph possible for the graph given below are ________.

1 Answer

0 votes
0 votes
There are 4 edges in this graph: total possibilities are 4C0 + 4C1 + 4C2 + 4C3 +4C4 (taking zero edge at a time + taking one edge at a time + go same--) = 16

Related questions

0 votes
0 votes
0 answers
1
Harsh Kumar asked Dec 11, 2018
494 views
Can primary keys be updated using sql update query?Is such a query accepted/rejected?
0 votes
0 votes
1 answer
2
charul asked Dec 4, 2017
502 views
A character of the data that binary search uses but the linear search ignores, isA.Order of the listB.Length of the listC.Maximum value in the listD.Minimum value in list...
4 votes
4 votes
3 answers
3
charul asked Nov 10, 2017
762 views
What is the output of the following program?main(){ printf("Hi"); fork(); }a) HiHib) Hic) nothing will be printedd) none of the above