No:
Syllabus
Course Name: Introduction to Graph Theory
Organization: Computer Science and Information Engineering
Grade: Senior
Lecturer:
Credit:3
Foundation Course: Discrete Mathematics
Hours:3
1.
□ Required
■Elective
Teaching Objectives:
This is an elective course for students in senior.
theory.
The students should learn the basic principal and application of graph
The course objective is to develop interest in graph theory and its many applications.
the Fundamental Theorems and Algorithms.
The emphasis will be on
This course shall enhance the students’ ability of analyzing, reasoning,
and problem solving.
Course Objectives
Core Abilities
Establish solid and professional abilities
1.1 Implement mathematic and logical abilities
for students
1.2 Have the specific abilities for information software
1.3 Have the specific abilities for information hardware
1.4 Ability to explore, analyze, and solve unknown problems
Develop abilities of information
2.1 Ability to employ modern software and understand the usage of
implementation and practice for students information systems
2.2Ability to develop hardware and software for information systems
Strengthen team works and cooperation
3.1 Ability to communicate and cooperate with each other
for students in a wide range of learning
3.2 Understanding of professional ethics and social responsibility
Symbols: ● Highly-Related ◎ Partially-Related ○ Non-Related
Outcomes and Assessment
This criterion assesses the quality and capabilities of the students and graduates. The program seeking accreditation
must:
1.1.1 ability to apply knowledge of mathematics, science, and engineering;
1.1.2 ability to carry out information process and scientific calculation;
2.1.1 ability to design and conduct experiments;
2.1.2 ability to analyze and interpret data;
2.2.1 ability to think logically, implement information technologies, and design creatively;
2.2.2 ability to analyze, design, and accomplish all kinds of problems by mean of independent thinking and integrated
creativity;
3.1.1 ability to apply professional techniques and make use of personal characteristics to provide practical contributions
for sake of self-establishment;
3.2.1 ability to organize, consult, and negotiate for solving professional problems via cooperating with a term in order to
be recognized by classmates and teachers;
3.3.1 ability to cultivate habits of life-long learning;
4.1.1 ability to care about society, humanities, enterprise ethics, and concern for society;
4.2.1 knowledge of contemporary issues; an understanding of the impact of engineering solutions in environmental,
societal, and global contexts in order to fit in with the changing impact of the international environment。
2.
Teaching Policy and Grading:
1. Participation 10%, 2.Homework 30%, 3. Midterm 30%, 4. Final Exam 30%
Descriptions for the Course:
The course material comes from “Introduction to Graph Theory” published by McGraw-Hill.
The course is handled
mainly lecturing by the instructor and the students will be asked to participate in the practice problems in class and
homework assignment (possibly programming assignment) after class.
3.
Contents and Progression:
Outline
Corresponding to Students’ Core
Implementation
Abilities
Topics
Contents
1.1 1.2 1.3 1.4 2.1 2.2 3.1 3.2 A
Introduction
1. Graphs
● ◎
2. Multigraphs and digraphs
● ◎
Degrees
Isomorphic Graphs
B
C
○ ● ◎
○ ○ ○  

○ ● ◎
○ ○ ○  

3.Degree of a vertex
● ◎ ○ ● ◎ ○ ○ ○  

4. Regular graphs
● ◎ ○ ● ◎ ○ ○ ○  

5. Degree sequences
● ◎
○ ○ ○  

6. definition of isomorphism
● ◎ ○ ● ◎ ○ ○ ○  

7. Bridges
● ◎ ○ ● ◎ ○ ○ ○  

8. Trees
● ◎ ○ ● ◎ ○ ○ ○

9. midterm exam
● ◎ ○ ● ◎ ○ ○ ○  

10. Cut-vertex , Block
● ◎ ○ ● ◎
○ ○ ○  

11. Connectivity
● ◎ ○ ● ◎
○ ○ ○  

12. Menger’s Theorem
● ◎ ○ ● ◎ ○ ○ ○  

13. Eulerian graphs
● ◎ ○ ● ◎
○ ○ ○  

14. Hamiltonian Graphs
● ◎ ○ ● ◎ ○ ○ ○  

15. strong digraphs
● ◎ ○ ● ◎ ○ ○ ○  

16.matching
● ◎ ○ ● ◎ ○ ○ ○  

17. factorization
● ◎ ○ ● ◎ ○ ○ ○ 

18.final exam
● ◎ ○ ● ◎ ○ ○ ○
Trees
Student practice
Connectivity
Traversability
Digraph
○ ● ◎

Matching
Student practice
4.


References:
[1]
Douglas B. West, Introduction to Graph Theory, Prentice Hall, 2008,
ISBN: 9789861548050
[2]
G. Chartrand & Ping Zhang, Introduction to Graph Theory, McGraw-Hill, 2005,
[3]
G. Chartrand, Introductory to Graph Theory, Chapman & Hall, 2004,
[4]
G. Agnarsson and R. Greenlaw, Graph Theory, Prentice Hall, 2007,
ISBN:9780071238229
ISBN: 1584883901
ISBN: 0131565362
D