mhrd logo inflibnet logo ugc logo

Module Details

Course : P-13. Number Theory And Graph Theory

Subject : Mathematics

No. of Modules : 76

Level : PG

Source : E-PG Pathshala

Back

Sr. No. Title E-Text Video URL Metadata
1 M-01. well ordering principle and its equivalence to mathematical induction - Click Here
2 M-04. gcd, euclidean algorithm and bă‚â´ezoută˘â€â™s identity - Click Here
3 M-02. properties of division of integers and division algorithm - Click Here
4 M-03.polygonal numbers - Click Here
5 M-12. euleră˘â€â™s theorem and dirichlet product - Click Here
6 M-09. wilsonă˘â€â™s and chinese remainder theorem - Click Here
7 M-11. properties of euleră˘â€â™s phi-function - Click Here
8 M-07. is there any formula for prime numbers? - Click Here
9 M-10. introduction to arithmetic functions - Click Here
10 M-06. there are infinite number of primes - Click Here
11 M-05. primes and their properties - Click Here
12 M-08. introduction to congruences - Click Here
13 M-13. nth roots of unity - Click Here
14 M-22. some known graph families and their properties - Click Here
15 M-15. quadratic residues/non-residues - Click Here
16 M-21. introduction to graph theory - Click Here
17 M-17. quadratic reciprocity law - Click Here
18 M-18. the gaussian integers - Click Here
19 M-20. pellă˘â€â™s equation - Click Here
20 M-19. pythagorean triples - Click Here
21 M-14. primitive roots - Click Here
22 M-16. gauss lemma - Click Here
23 M-31. review of eigenvalues and eigenvectors of a square matrix - Click Here
24 M-25. graph isomorphism and automorphism group of a graph - Click Here
25 M-23. construction of new graphs from old graphs - Click Here
26 M-27. eulerian and hamiltonian graphs - Click Here
27 M-28. planar graphs and coloring - Click Here
28 M-24. connectedness of a graph - Click Here
29 M-29. matching and covering - Click Here
30 M-30. network flows - Click Here
31 M-26. trees - Click Here
32 M-33. bounds of eigenvalues of subgraphs and eigenvalues of regular graphs - Click Here
33 M-35. automorphisms of graphs and adjacency matrix - Click Here
34 M-34. eigenvalues of some known graphs/digraphs - Click Here
35 M-32. adjacency matrix of a graph - Click Here
36 M-38. laplacian matrix of a graph - Click Here
37 M-37. incidence matrix of a graph - Click Here
38 M-36. nonnegative matrices - Click Here
39 M-01. well ordering principle and its equivalence to mathematical induction - Click Here
40 M-04. gcd, euclidean algorithm and bă‚â´ezoută˘â€â™s identity - Click Here
41 M-02. properties of division of integers and division algorithm - Click Here
42 M-07. is there any formula for prime numbers? - Click Here
43 M-06. there are infinite number of primes - Click Here
44 M-05. primes and their properties - Click Here
45 M-08. introduction to congruences - Click Here
46 M-03.polygonal numbers - Click Here
47 M-12. euleră˘â€â™s theorem and dirichlet product - Click Here
48 M-09. wilsonă˘â€â™s and chinese remainder theorem - Click Here
49 M-11. properties of euleră˘â€â™s phi-function - Click Here
50 M-10. introduction to arithmetic functions - Click Here
51 M-15. quadratic residues/non-residues - Click Here
52 M-17. quadratic reciprocity law - Click Here
53 M-13. nth roots of unity - Click Here
54 M-14. primitive roots - Click Here
55 M-16. gauss lemma - Click Here
56 M-25. graph isomorphism and automorphism group of a graph - Click Here
57 M-22. some known graph families and their properties - Click Here
58 M-23. construction of new graphs from old graphs - Click Here
59 M-21. introduction to graph theory - Click Here
60 M-24. connectedness of a graph - Click Here
61 M-18. the gaussian integers - Click Here
62 M-20. pellă˘â€â™s equation - Click Here
63 M-19. pythagorean triples - Click Here
64 M-26. trees - Click Here
65 M-33. bounds of eigenvalues of subgraphs and eigenvalues of regular graphs - Click Here
66 M-31. review of eigenvalues and eigenvectors of a square matrix - Click Here
67 M-35. automorphisms of graphs and adjacency matrix - Click Here
68 M-34. eigenvalues of some known graphs/digraphs - Click Here
69 M-27. eulerian and hamiltonian graphs - Click Here
70 M-32. adjacency matrix of a graph - Click Here
71 M-28. planar graphs and coloring - Click Here
72 M-29. matching and covering - Click Here
73 M-30. network flows - Click Here
74 M-38. laplacian matrix of a graph - Click Here
75 M-37. incidence matrix of a graph - Click Here
76 M-36. nonnegative matrices - Click Here