Discrete Mathematics

 Discrete Mathematics Solver 

Discrete Mathematics

141. Set Union: $A\cup B$

142. Set Intersection: $A\cap B$

143. Set Difference: $A-B$

144. Set Complement: $A^c$

145. Cartesian Product: $A\times B$

146. Power Set: $\mathcal{P}(A)$

147. Permutations: $P(n,k)=\frac{n!}{(n-k)!}$

148. Combinations: $C(n,k)=\frac{n!}{k!(n-k)!}$

149. Pigeonhole Principle: If $n>m$, at least one container holds more than one item.

150. Graph Theory: $G=(V,E)$

151. Degree of a Vertex: $\mathrm{deg}(v)$

152. Eulerian Path: A path that visits every edge exactly once.

153. Hamiltonian Path: A path that visits every vertex exactly once.

154. Tree: A connected acyclic graph.

155. Spanning Tree: A tree that includes all vertices of a graph.

156. Minimum Spanning Tree: A spanning tree with the minimum total edge weight.

157. Dijkstra's Algorithm: Shortest path algorithm.

158. Floyd-Warshall Algorithm: All-pairs shortest path algorithm.

159. Kruskal's Algorithm: Minimum spanning tree algorithm.

160. Prim's Algorithm: Minimum spanning tree algorithm.