111 votes
9 answers
92
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to$15$$30$$90$$36...
4 votes
2 answers
94
93 votes
8 answers
98
52 votes
10 answers
100
14 votes
3 answers
103
Is there any systematic approach to find the minimum number of two input NAND gates and two input NOR gates to be used to impelement a binary expression?If there then ple...
49 votes
10 answers
104
27 votes
4 answers
105
5 votes
1 answer
108