PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
MAT 608	GRAPH AND COMBINATORICS	3 + 0	1st Semester	7,5

COURSE DESCRIPTION

Course Level	Master's Degree
Course Type	Elective
Course Objective	It is to give information about how to use the concepts of graph theory in solution techniques and to produce solutions to the many current problems that can be encountered in daily life.
Course Content	Recurrence and counting rules, definition of graph, edge and vertex, tree and forest definition, connectedness of graph, graph types, matrices representation of graph , algorithms, isomorphic graphs and algebraic structure of graphs, application of graph to daily life problems.
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.

COURSE LEARNING OUTCOMES

1	Knows definitions of graph and subgraph.
2	Says concepts of Euler and Hamilton graphs.
3	Displays the edges of the graph with a matrix.
4	Understands connectivity of graph and types.
5	Learns information about convex polyhedras.
6	Tries to apply graph some daily life problems.
7	Knows graph algorithms.

COURSE'S CONTRIBUTION TO PROGRAM

	PO 01	PO 02	PO 03	PO 04	PO 05	PO 06	PO 07	PO 08
LO 001	4	4		4
LO 002	5			5		4		4
LO 003		4		5		4
LO 004	5	4		4		4	5
LO 005	5		4		4		4
LO 006		4		4	5		4
LO 007	4		5			4		5
Sub Total	23	16	9	22	9	16	13	9
Contribution	3	2	1	3	1	2	2	1

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	3	42
Hours for off-the-classroom study (Pre-study, practice)	14	7	98
Assignments	1	5	5
Final examination	1	35	35
Midterm	1	15	15
Total Work Load ECTS Credit of the Course			195 7,5

COURSE DETAILS

Select Year

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester	Mode of Delivery
MAT 608	GRAPH AND COMBINATORICS	3 + 0	1	Turkish	2025-2026 Spring	Face to Face

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
Prof. Dr. MURAT BEŞENK	mbesenk@pau.edu.tr		FEN A0201	%

Goals		It is to give information about how to use the concepts of graph theory in solution techniques and to produce solutions to the many current problems that can be encountered in daily life.
Content		Recurrence and counting rules, definition of graph, edge and vertex, tree and forest definition, connectedness of graph, graph types, matrices representation of graph , algorithms, isomorphic graphs and algebraic structure of graphs, application of graph to daily life problems.

Topics

Materials

Materials are not specified.

Resources

Course Assessment

Assesment Methods	Percentage (%)	Assesment Methods Title
Final Exam	50	Final Exam
Midterm Exam	50	Midterm Exam

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student