Math by Tathagata
A tree with n vertices has (n-1) edges. For example, a tree with 5 vertices should have 5-1=4 edges. In this post, we prove that a tree contains (n-1) edges if it has n vertices. A tree of n vertices has n-1 edges Theorem: Show that a tree with n vertices has (n-1) edges. Proof: … Read more
For n≥2, a simple graph with n vertices has a pair of vertices of same degree. In this post, we will prove this theorem on simple graphs. Before we do this, let us first recall a simple graph which is given below. A graph is called a simple graph if there is only one edge … Read more
This is the assignment set on Discrete Mathematics for Sec C. The questions are given as follows: Assignment Problems Due Date: 26th Nov Q1: When a statement are considered to be contingency/contradiction? Q2: What is an equivalence relation? Give an example. Q3: If 5 people are seated about a round table then how many different … Read more