Scribd
Upload
6 views3 pages

Set Theory and Graph Concepts Explained

The document outlines various mathematical concepts and problems related to sets, functions, graphs, and combinatorics. It includes definitions, proofs, and examples of principles such as the pigeonhole principle, Hamiltonian paths, and Euler circuits. Additionally, it poses questions regarding committee formation and operations on sets, indicating a focus on both theoretical and practical applications in mathematics.

Uploaded by

sumitmendhe33
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views3 pages

Set Theory and Graph Concepts Explained

The document outlines various mathematical concepts and problems related to sets, functions, graphs, and combinatorics. It includes definitions, proofs, and examples of principles such as the pigeonhole principle, Hamiltonian paths, and Euler circuits. Additionally, it poses questions regarding committee formation and operations on sets, indicating a focus on both theoretical and practical applications in mathematics.

Uploaded by

sumitmendhe33
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

UNIT 2:-

1. Let A and B are two sets. Prove that :

2.

3.

4. Explain and prove the pigeonhole principle.


5.

6. Explain the operation of set and its types with examples


7.

8.

9.
10.

11.
12. Explain inclusion and equality of sets with suitable example.
13. How many different seven person committees can be formed each containing three women
from an available set of twenty women and four men from an available set of thirty men?
14.

15. Define set, subset and power set.


16. Define following operations on set with Venn diagrams :
(i) Union
(ii) Intersection
(iii) Set difference
(iv) Symmetric difference.

UNIT 3:-

1.

2.

3. Define the following functions :


(i) Onto
(ii) One-to-One
(iii) Inverse function
(iv) Composite function.

4. How many different seven person committees can be formed each containing three
women from an available set of twenty women and four men from an available set of
thirty men?
5.
6.

UNIT 4:-

1. Define Hamiltonian path and Hamiltonian circuit with suitable example


2. Define following terms with the help suitable example :
(i) Vertex (ii) Degree of vertex (iii) Edge (iv) Isolated vertex (v) Adjacent vertex
3. Define semi groups, identity and monoids.
4. Let A = {v1, v2, v3, v4, v5, v6, v7, v8, v9, v10} and
Let T = {(v2, v3), (v2, v1), (v4, v5), (v4, v6), (v5, v8), (v6, v7), (v4, v2), (v7, v9), (v7, v10)}
Show that T is a rooted Tree and identify the root.
5. Prove that, if a Group G has a vertex of odd degree, there can be no Euler circuit in G.
6. Define Isomorphism and Homomorphism. What procedure is used to show that two semi
groups are isomorphic?
7. Draw the Hasse Diagram of divisibility on a set for D20.
8. Define bounded and distributive lattice.
9. Define Euler path and Euler circuit.
10. Define subgraph of a graph G.
11.

12.

13.

You might also like