|
Language of Instruction
|
English
|
|
Level of Course Unit
|
Bachelor's Degree
|
|
Department / Program
|
COMPUTER ENGINEERING
|
|
Type of Program
|
Formal Education
|
|
Type of Course Unit
|
Elective
|
|
Course Delivery Method
|
Face To Face
|
|
Objectives of the Course
|
The purpose of the course is to present the basic concepts and techniques of combinatorics, and to give a short introduction to main problems in graph theory.
|
|
Course Content
|
Graph, vertex, edge definitions and properties
Simple and multigraph graphs
Directed and undirected graphs
Concepts of adjacency and degree
Graph matrices Adjacency matrix, Incidence matrix, Cut matrix
Connectivity and graph components
Eulerian graphs and Eulerian cycles
Hamiltonian graphs and Hamiltonian cycles
Trees and forests
Critical path and critical node problems
Graph coloring problems
Graph cut problems
Graph matching problems
|
|
Course Methods and Techniques
|
Lecture, Problem Solving
|
|
Prerequisites and co-requisities
|
( BBM102 ) and ( BBM104 )
|
|
Course Coordinator
|
None
|
|
Name of Lecturers
|
Associate Prof.Dr. Lale Özkahya
|
|
Assistants
|
None
|
|
Work Placement(s)
|
No
|
Recommended or Required Reading
|
Resources
|
Brualdi A. R., " Introductory Combinatorics ", Prentice Hall, New Jersey, 1999
Gould R., " Graph Theory ", The benjamin/Cummings Pub. California, 1988
|
|
Course Notes
|
1.Brualdi A. R., “ Introductory Combinatorics”, Prentice Hall, New Jersey, 1999
2.Gould R., “Graph Theory”, The benjamin/Cummings Pub. California, 1988
|
|