{"id":4686,"date":"2024-12-19T03:45:14","date_gmt":"2024-12-19T03:45:14","guid":{"rendered":"https:\/\/science.sjp.ac.lk\/mat\/?page_id=4686"},"modified":"2024-12-19T03:45:44","modified_gmt":"2024-12-19T03:45:44","slug":"mat-353-3-0-graph-theory","status":"publish","type":"page","link":"https:\/\/science.sjp.ac.lk\/mat\/mat-353-3-0-graph-theory\/","title":{"rendered":"MAT 353 3.0 Graph Theory"},"content":{"rendered":"<section class=\"wpb-content-wrapper\"><p>[vc_row][vc_column][vc_column_text]<\/p>\n<p><strong>Course:\u00a0\u00a0<\/strong>MAT 353 3.0 Graph Theory (Compulsory)<\/p>\n\n<p><strong>Course Content<\/strong>:<\/p>\n\n<p style=\"text-align: justify;\">Introduction to Graphs;Basic Definitions in Graph Theory, Traveling Through a Graph, Graph Representation, Planarity of Graphs, Coloring of Graphs. Trees; Basic Definitions for Trees, Spanning Trees, Minimum Spanning Trees. Paths and Flows: Shortest Paths and Longest Paths, Flows. Matching: Matching and Covers, Algorithms and Applications.<\/p>\n\n<p><strong>Recommend 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> (2nd ed.).<\/li>\n\n\n<li>Grossman, J. W. (1990). <em>Discrete mathematics: An introduction to concepts, methods, and applications<\/em>. New York: Macmillan Publishing.<\/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:\u00a0\u00a0MAT 353 3.0 Graph Theory (Compulsory) Course Content: Introduction to Graphs;Basic Definitions in Graph Theory, Traveling Through a Graph, Graph Representation, Planarity of Graphs, Coloring of Graphs. Trees; Basic Definitions for Trees, Spanning Trees, Minimum Spanning Trees. Paths and Flows: Shortest Paths and Longest Paths, Flows. Matching: Matching and Covers, Algorithms and Applications. Recommend &hellip; <a href=\"https:\/\/science.sjp.ac.lk\/mat\/mat-353-3-0-graph-theory\/\" class=\"more-link\">Continue reading <span class=\"screen-reader-text\">MAT 353 3.0 Graph Theory<\/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\/4686"}],"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=4686"}],"version-history":[{"count":2,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4686\/revisions"}],"predecessor-version":[{"id":4694,"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/pages\/4686\/revisions\/4694"}],"wp:attachment":[{"href":"https:\/\/science.sjp.ac.lk\/mat\/wp-json\/wp\/v2\/media?parent=4686"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}