This document outlines 3 assignments involving sets, relations, and graph theory. Assignment 1 asks to determine if a relation R1 over set A is reflexive, symmetric, and transitive or irreflexive, anti-symmetric, and transitive. Assignment 2 involves finding the minimum spanning tree of a graph using Prim's and Kruskal's algorithms. Assignment 3 asks to write an Euler circuit, Euler path, and Hamilton circuit for a given graph.
This document outlines 3 assignments involving sets, relations, and graph theory. Assignment 1 asks to determine if a relation R1 over set A is reflexive, symmetric, and transitive or irreflexive, anti-symmetric, and transitive. Assignment 2 involves finding the minimum spanning tree of a graph using Prim's and Kruskal's algorithms. Assignment 3 asks to write an Euler circuit, Euler path, and Hamilton circuit for a given graph.
This document outlines 3 assignments involving sets, relations, and graph theory. Assignment 1 asks to determine if a relation R1 over set A is reflexive, symmetric, and transitive or irreflexive, anti-symmetric, and transitive. Assignment 2 involves finding the minimum spanning tree of a graph using Prim's and Kruskal's algorithms. Assignment 3 asks to write an Euler circuit, Euler path, and Hamilton circuit for a given graph.
This document outlines 3 assignments involving sets, relations, and graph theory. Assignment 1 asks to determine if a relation R1 over set A is reflexive, symmetric, and transitive or irreflexive, anti-symmetric, and transitive. Assignment 2 involves finding the minimum spanning tree of a graph using Prim's and Kruskal's algorithms. Assignment 3 asks to write an Euler circuit, Euler path, and Hamilton circuit for a given graph.