MA 330 - Graph Theory & Combinatories

Institution:

Arcadia University

Subject:

Mathematics

Description:

Graph theory topics include planar graphs, Euler and Hamiltonian circuits, graph coloring, trees, depth-first and breadth-first search, network algorithms. Combinatorial topics include arrangements and selections, generating functions, recurrence relations, pigeon-hole principle, and inclusion-exclusion. Course covers applications to computer science and business and also material of interest to mathematics/secondary education majors. MA330 may be used to satisfy the Computer Science MA230 requirement. Prerequisite: MA221.

Credits:

4.00

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.arcadia.edu

Phone Number:

(215) 572-2900

Regional Accreditation:

Middle States Association of Colleges and Schools

Calendar System:

Semester

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.