GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 5:
1. PLANAR GRAPH
2. NONPLANAR GRAPH
3. THEOREM 5.1.
4. THEOREM 5.2.
5. THEOREM 5.6.
Friday, November 13, 2020
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 4:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 4:
1. CUT SET
2. THEOREM 4.1.
3. THEOREM 4.2.
4. THEOREM 4.3.
5. FUNDAMENTAL CUT SET.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 3:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 3 :
1.TREE
2. NULL TREE
3. THEOREM 3.1.
4. THEOREM 3.2.
5. THEOREM 3.3.
6. THEOREM 3.4.
7. THEOREM 3.5.
8. THEOREM 3.6.
9. THEOREM 3.7.
10. DISTANCE , CENTERS.
11. METRIC.
12. THEOREM 3.8.
13. THEOREM 3.9.
14. RADIUS , DIAMETER.
15. ROOTED AND BINARY TREE.
16. HEIGHT,LEVEL
17. WEIGHTED PATH LENGTH.
18. THEOREM 3.10.
19. UNLABELED TREE.
20. SPANNING TREE, MINIMAL SPANNING TREE.
21. THEOREM 3.11.
22. THEOREM 3.12.
23. RANK AND NULLITY.
24. MINIMAL SPANNING TREE ALGORITHM.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 2:
GRAPH THEORY N.DEO CHAPTER WISE QUESTION
CHAPTER 2:
1. ISOMORPHISM
2. SUBGRAPH
3. VERTEX DISJOINT, EDGE DISJOINT.
4. WALK, PATH, CIRCUIT
5. OPEN WLAK, CLOSED WALK.
6. CONNECTED GRAPH, DISCONNECTED GRAPH
7. COMPONENT
8. THEOREM 2-1.
9. THEOREM 2-2.
10. THEOREM 2-3.
11. EULER LINE, EULER GRAPH
12. THEOREM 2-4.
13. UNICURSAL LINE ,UNICURSAL GRAPH..
14. THEOREM 2-5.
15. UNION, INTERSECTION,RING SUM, DECOMPOSITION,DELETION
16. FUSION.
17. THEOREM 2-6.
18. ARBITRARILY TRACEABLE GRAPH.
19. THEOREM 2-7.
20. HAMILTONIAN PATH AND HAMILTONIAN CIRCUIT.
21. COMPLETE GRAPH.
22. THEOREM 2-8.
23. THEOREM 2-9.
24. EXERCISE 2.5.
25. EXERCISE 2.6.
26. EXERCISE 2.8.
GRAPH THEORY N.DEO CHAPTER WISE QUESTION CHAPTER 1:
CHAPTER 1:
1. LINEAR GRAPH DEFINITION.
2. SELF LOOP.
3. PARALLEL EDGES.
4. SIMPLE GRAPH.
5. KONIGSBERG BRIDGE PROBLEM.
6. FINITE , INFINITE GRAPH.
7. INCIDENCE AND DEGREE.
8. THEOREM- 1.1
9. ISOLATED VERTEX, PENDANT VERTEX.
10. NULL GRAPH
11. EXERCISE - 1.9, 1.10, 1.11, 1.12
Software Lab Based on R Programming
Software Lab Based on R Programming ( UGC CBCS ASSIGNMENT)
1. Write a program that prints ‗Hello World‘ to the screen. CLICK HERE ( NO VOICE )
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n. CLICK HERE
3. Write a program that prints a multiplication table for numbers up to 12. CLICK HERE
4. Write a function that returns the largest element in a list. CLICK HERE
5. Write a function that computes the running total of a list. CLICK HERE
6. Write a function that tests whether a string is a palindrome. CLICK HERE
7. Implement the following sorting algorithms:
i) Selection sort, CLICK HERE
ii) Insertion sort, - CLICK HERE
iii) Bubble Sort - CLICK HERE
8. Implement linear search. - CLICK HERE
9. Implement binary search. - CLICK HERE
10. Implement matrices addition, subtraction and Multiplication CLICK HERE
6. Write a function that tests whether a string is a palindrome.( R Programming )
6. Write a function that tests whether a string is a palindrome.( R Programming )
5. Write a function that computes the running total of a list.( R Programming )
5. Write a function that computes the running total of a list.( R Programming )
3. Write a program that prints a multiplication table for numbers up to 12.( R Programming )
3. Write a program that prints a multiplication table for numbers up to 12.( R Programming )
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n. ( R Programming )
2. Write a program that asks the user for a number n and prints the sum of the numbers 1 to n. ( R Programming )
Subscribe to:
Posts (Atom)