# MAT 460 Graph Theory and Algorithms

Instructor:
Office:
Office hours:
Phone:
Email:

### Course Description

Graphs, digraphs, multigraphs, graph modeling, degrees and degree sequences, subgraphs, isomorphisms of graphs, and digraphs, distance concepts and applications, trees, and tree algorithms, Hamiltonian and Eulerean graphs. The viewpoints will be conceptual, theoretical, and algorithmic.

3 units credit.

### Prerequisites

MAT 211, MAT 271, and MAT 241 or CSC 121 or CSC 115, or equivalent with a grade of "C" or better. MAT 281 with a grade of "C" or better is recommended.

### Text

Texts are chosen by the instructor. For example:

A. Stanoyevitch, Discrete Structures with Contemporary Applications, Chapman & Hall (2011)

### Course Requirements, Tentative Schedule of Class Meetings and Topics, Readings, Assignments and Due dates, Exams

A schedule of class meetings, topics, assignments, due dates, exam dates, etc. will be provided by instructor. See your class syllabus.

Here is an example course outline, based on the above text.

 Week Topics 1 Overview of the subject with introductions to some key graph concepts and examples 2 Degree sequences of graphs, and an algorithm for determining whether a given sequence can be realized as the degree sequence of a simple graph 3 Digraphs, multigraphs, and modeling real-life problems with graphs 4 Distance related concepts in graphs 5 Subgraphs Exam #1 6 Graph and digraph isomorphisms 7 Matrix representations of graphs and applications of matrix operations 8 Trees (very important types of graph) 9 Spanning Trees and means of construction 10 Applications of spanning trees Exam #2 11 Tree Growing Algorithms 12 The traveling salesman problem, and related problems 13 Hamiltonian graphs 14 Network Flows 15 Review for final

The final exam is given at the date and time announced in the Schedule of Classes.

### Learning Objectives

After completing MAT 460, students will

• Identify properties and characteristics of graphs
• Write proofs of theorems involving graph concepts and definitions
• Reframe an assortment of real-life problems in terms of graph theoretic problems
• Decide whether two differently presented graphs are the same (isomorphic) from a graph theoretical perspective
• Execute graph algorithms, both by hand, and with the assistance of a computer
• Determine whether a given applied or pure graph problem can be solved by an efficient algorithm, and if so, to describe such an algorithm

### Computers and Calculators, Computer Literacy

Most instructors encourage the use of machines, calculators computers, phones etc., for analyzing data. The use of machines may be restricted during examinations or at certain other times. Ask your instructor for the policy in your class.

Students are not expected to be programmers or to know any particular computer language before starting this class. Some instructors may expect students to be able to access information on the internet, or to use calculators, or to learn to use particular software with instruction. Basic skill in algebra and the use of mathematical symbols, order of operations etc., and the willingness to read and follow instruction manuals and help files will suffice.

Students' grades are based on homework, class participation, short tests, and scheduled examinations covering students' understanding of the topics covered in this course. The instructor determines the relative weights of these factors and the grading scale. See the syllabus for your particular class.

### Location of Class Meetings

Classes meet on the dates and room announced in the official Schedule of Classes. This is a traditional, face-to-face class.

### Attendance Requirements

Attendance policy is set by the instructor.

### Policy on Due Dates, Make-Up Work, Missed Exams, and Extra-Credit Assignments

Due dates and policy regarding make-up work and missed exams are set by the instructor. Instructors may, or may not, choose to offer extra credit assignments. If extra credit assignments are offered they will be available to all students.

The mathematics department does not tolerate cheating. Students who have questions or concerns about academic integrity should ask their professors or the counselors in the Student Development Office, or refer to the University Catalog for more information. (Look in the index under "academic integrity".)

### Accomodations for Students with Disabilities

Cal State Dominguez Hills adheres to all applicable federal, state, and local laws, regulations, and guidelines with respect to providing reasonable accommodations for students with temporary and permanent disabilities. If you have a disability that may adversely affect your work in this class, I encourage you to register with Disabled Student Services (DSS) and to talk with me about how we best can help you. All disclosures of disabilities will be kept strictly confidential. Please note: you must register with DSS to arrange an no accommodation. For information call (310) 243-3660 or send an email message to dss@csudh.edu or visit the DSS website http://www4.csudh.edu/dss/contact-us/index or visit their office WH D-180

### Behavioral Expectations

We all are adults so behavior rarely is an issue. Just follow the Golden Rule: "do unto others as you would have them do unto you" then everything will be fine.

The university must maintain a classroom environment that is suitable for learning, so anyone who insists on disrupting that environment will be expelled from the class.

Revision history:

Prepared by A. Stanoyevitch, spring 2010. Revised 3/4/2011, 1/10/15 (G. Jennings).