{"id":4769,"date":"2024-12-19T05:20:12","date_gmt":"2024-12-19T05:20:12","guid":{"rendered":"https:\/\/science.sjp.ac.lk\/mat\/?page_id=4769"},"modified":"2024-12-19T05:20:39","modified_gmt":"2024-12-19T05:20:39","slug":"amt-313-1-0-computational-discrete-mathematics","status":"publish","type":"page","link":"https:\/\/science.sjp.ac.lk\/mat\/amt-313-1-0-computational-discrete-mathematics\/","title":{"rendered":"AMT 313 1.0 Computational Discrete Mathematics"},"content":{"rendered":"<section class=\"wpb-content-wrapper\"><p>[vc_row][vc_column][vc_column_text]<\/p>\n<p><strong>Course:\u00a0AMT 313 1.0 Computational Discrete Mathematics<\/strong>\u00a0<strong>(Compulsory)<\/strong><\/p>\n\n<p><strong>Course content:<\/strong><\/p>\n\n<p style=\"text-align: justify;\">Graph Representation: Data Structures for Graphs, Modifying, Classifying, and Displaying Graphs, Basic Graph Embeddings, Improving Graph Embeddings, Storing and Editing Graphs<strong>, <\/strong>Generating Graphs:Building Graphs from other Graphs, Regular Structures, Trees, Random Graphs, Relation and Functional Graphs<strong>, <\/strong>and Properties of Graphs:Graph Traversals, Connectivity, Cycles in Graphs, Graph Coloring, Cliques, Vertex Covers and Independent Sets<\/p>\n\n<p><strong>Recommended Readings:<\/strong><\/p>\n\n\n<ol type=\"1\">\n<li style=\"list-style-type: none;\">\n<ol type=\"1\"><\/p>\n<li>Gross,J.L. &amp; Yellon,J. (2006). <em>Graph Theory and Its Applications <\/em>(2<sup>nd <\/sup>ed). CRC Press.<\/li>\n\n\n<li>Grossman.J.W. (1990). <em>Discrete Mathematics (An Introduction to Concepts, Methods, and Applications) <\/em>(1<sup>st<\/sup> ed). Macmillan Publishing Company.<\/li>\n<\/ol>\n<\/li>\n<\/ol>\n\n\n<p>&nbsp;<\/p>\n<p>[\/vc_column_text][\/vc_column][\/vc_row]<\/p>\n<\/section>","protected":false},"excerpt":{"rendered":"<p>[vc_row][vc_column][vc_column_text] Course:\u00a0AMT 313 1.0 Computational Discrete Mathematics\u00a0(Compulsory) Course content: Graph Representation: Data Structures for Graphs, Modifying, Classifying, and Displaying Graphs, Basic Graph Embeddings, Improving Graph Embeddings, Storing and Editing Graphs, Generating Graphs:Building Graphs from other Graphs, Regular Structures, Trees, Random Graphs, Relation and Functional Graphs, and Properties of Graphs:Graph Traversals, Connectivity, Cycles in Graphs, Graph &hellip; <a href=\"https:\/\/science.sjp.ac.lk\/mat\/amt-313-1-0-computational-discrete-mathematics\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">AMT 313 1.0 Computational Discrete Mathematics<\/span><\/a><\/p>\n","protected":false},"author":33,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_ti_tpc_template_sync":false,"_ti_tpc_template_id":"","footnotes":""},"_links":{"self":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4769"}],"collection":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/users\/33"}],"replies":[{"embeddable":true,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/comments?post=4769"}],"version-history":[{"count":2,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4769\/revisions"}],"predecessor-version":[{"id":4773,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4769\/revisions\/4773"}],"wp:attachment":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/media?parent=4769"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}