|Course Title||Code||Semester||L+P Hour||Credits||ECTS|
|Graph Theory *||MT 416||8||3||3||5|
|Prerequisites and co-requisites|
|Recommended Optional Programme Components||None|
|Language of Instruction||Turkish|
|Course Level||First Cycle Programmes (Bachelor's Degree)|
|Course Coordinator||Assoc.Prof.Dr. Dilek KAHYALAR|
To inform the students about the Graphs theory which was based on the problem mentioned by the Swiss mathematician Euler in his article The problem of seven bridges.
The definitions of graphs, isomorphic graphs. Paths and Cycles, examples of special graphs. Adjacency and incidence matrices of graphs. The definitions of digraphs. Eulerian and Hamiltonian graphs and digraphs. The shortest and longest path algorithms. Connectivity, Mengers theorem. Trees, spanning trees. Planarity, planar graphs, Eulars formula, testing for planarity.
|Course's Contribution To Program|
|No||Program Learning Outcomes||Contribution|
Is able to prove Mathematical facts encountered in secondary school.
Recognizes the importance of basic notions in Algebra, Analysis and Topology
Develops maturity of mathematical reasoning and writes and develops mathematical proofs.
Is able to express basic theories of mathematics properly and correctly both written and verbally
Recognizes the relationship between different areas of Mathematics and ties between Mathematics and other disciplines.
Expresses clearly the relationship between objects while constructing a model
Draws mathematical models such as formulas, graphs and tables and explains them
Is able to mathematically reorganize, analyze and model problems encountered.
Knows at least one computer programming language
Uses effective scientific methods and appropriate technologies to solve problems
Has sufficient knowledge of foreign language to be able to understand Mathematical concepts and communicate with other mathematicians
In addition to professional skills, the student improves his/her skills in other areas of his/her choice such as in scientific, cultural, artistic and social fields
Knows programming techniques and is able to write a computer program
Is able to do mathematics both individually and in a group.
|1||Definitions and Examples||Review of the relevant pages from sources|
|2||Isomorphic Graphs||Review of the relevant pages from sources|
|3||Matrix of Graphs||Review of the relevant pages from sources|
|4||Paths||Review of the relevant pages from sources|
|5||Cycles||Review of the relevant pages from sources|
|6||Family of graph||Review of the relevant pages from sources|
|7||Digraphs||Review of the relevant pages from sources|
|8||Midterm Exam||Review of the topics discussed in the lecture notes and sources again|
|9||Eulerian Graphs||Review of the relevant pages from sources|
|10||Hamilton Graphs||Review of the relevant pages from sources|
|11||Path Algorithms||Review of the relevant pages from sources|
|12||Connectivity||Review of the relevant pages from sources|
|13||Hamiltonian Digraphs||Review of the relevant pages from sources|
|14||Matrices of Digraphs||Review of the relevant pages from sources|
|15||Matrices of Digraphs||Review of the relevant pages from sources|
|16-17||Final Exam||Review of the topics discussed in the lecture notes and sources again|
|Recommended or Required Reading|