This unique free application is for all students across the world. It covers 114 topics of Graph Theory in detail. These 114 topics are divided in 4 units. Each topic is around 600 words and is complete with diagrams, equations and other forms of graphical representations along with simple text explaining the concept in detail. This USP of this application is 'ultra-portability'. Students can access the content on-the-go from anywhere they like. Basically, each topic is like a detailed flash card and will make the lives of students simpler and easier. Some of topics Covered in this application are: 1. Introduction to Graphs 2. Directed and Undirected Graph 3. Basic Terminologies of Graphs 4. Vertices 5. The Handshaking Lemma 6. Types of Graphs 7. N-cube 8. Subgraphs 9. Graph Isomorphism 10. Operations of Graphs 11. The Problem of Ramsay 12. Connected and Disconnected Graph 13. Walks Paths and Circuits 14. Eulerial Graphs 15. Fluery's Algorithm 16. Hamiltonian Graphs 17. Dirac's Theorem 18. Ore's Theorem 19. Problem of seating arrangement 20. Travelling Salesman Problem 21. Konigsberg's Bridge Problem 22. Representation of Graphs 23. Combinatorial and Geometric Graphs 24. Planer Graphs 25. Kuratowaski's Graph 26. Homeomorphic Graphs 27. Region 28. Subdivision Graphs and Inner vertex Sets 29. Outer Planer Graph 30. Bipertite Graph 31. Euler's Theorem 32. Three utility problem 33. Kuratowski’s Theorem 34. Detection of Planarity of a Graph 35. Dual of a Planer Graph 36. Graph Coloring 37. Chromatic Polynomial 38. Decomposition theorem 39. Scheduling Final Exams 40. Frequency assignments and Index registers 41. Colour Problem 42. Introduction to Tree 43. Spanning Tree 44. Rooted Tree 45. Binary Tree 46. Traversing Binary Trees 47. Counting Tree 48. Tree Traversal 49. Complete Binary Tree 50. Infix, Prefix and Postfix Notation of an Arithmatic Operation 51. Binary Search Tree 52. Storage Representation of Binary Tree 53. Algorithm for Constructing Spanning Trees 54. Trees and Sorting 55. Weighted Tree and Prefix Codes 56. Huffman Code 57. More Application of Graph 58. Shortest Path Algorithm 59. Dijkstra Algorithm 60. Minimal Spanning Tree 61. Prim’s algorithm 62. The labeling algorithm 63. Reachability, Distance and diameter, Cut vertex, cut set and bridge 64. Transport Networks 65. Max-Flow Min-Cut Theorem 66. Matching Theory 67. Hall's Marriage Theorem 68. Cut Vertex 69. Introduction to Matroids and Transversal Theory 70. Types of Matroid 71. Transversal Theory 72. Cut Set 73. Types of Enumeration 74. Labeled Graph 75. Counting Labeled tree 76. Rooted Lebeled Tree 77. Unlebeled Tree 78. Centroid 79. Permutation 80. Permutation Group 81. Equivalance classes of Function 82. Group 83. Symmetric Graph 84. Coverings 85. Vertex Covering 86. Lines and Points in graphs 87. Partitions and Factorization 88. Arboricity of Graphs 89. Digraphs 90. Orientation of a graph 91. Edges and Vertex 92. Types of Digraphs 93. Connected Digraphs 94. Condensation, Reachability and Oreintable Graph 95. Arborescence 96. Euler Digraph 97. Hand Shaking Dilemma and Directed Walk path and Circuit 98. Semi walk paths and Circuits and Tournaments 99. Incident, Circuit and Adjacency Matrix of Digraph 100. Nullity of a Matrix 101. Chromatic number 102. Calculating a Chromatic number 103. Brooks Theorem 104. Brooks Theorem 105. Matrix Representation of Graphs 106. Cut Matrix 107. Circuit Matrix 108. Matrices over GF(2) and Vector Spaces of Graphs 109. Introduction to Graph Coloring 110. Planar Graphs 111. Euler’s formula 112. Kruskal’s algorithm 113. Heuristic algorithm for an upper bound 114. Heuristic algorithm for an lower bound
Manufacturer: Ashish Kumar
Brand: Ashish Kumar
We hope you love the products we recommend! All of products are independently selected by deal-dx editors. Just to let you know, deal-dx may collect a share of sales or other compensation from the links on this page if you decide to shop from them. As an Amazon Associate we earn from qualifying purchases. Prices are accurate and items in stock as of time of publication.
This website uses cookies for the correct display and functionality. Do you also want to take full advantage of the website and accept cookies? About cookies. Accept cookies
