6.5 Graphs, Networks, and Discrete Structures

Discrete Structures Model Relationships

AEPA Domain V names discrete mathematics directly: permutations and combinations, sequences and series, matrices and vectors, and set theory. The outline section title also points to graphs and networks, which are natural representations for discrete relationships even when the official competency list uses broader language. A graph in this sense is not a coordinate graph. It is a set of vertices connected by edges. Vertices might represent cities, people, tasks, courses, or websites. Edges might represent roads, friendships, prerequisites, or links.

This chapter section is about choosing and interpreting structures. Discrete mathematics often uses finite objects, whole-number counts, and yes-or-no relationships. That makes it useful for teacher-certification questions because students must decide what the objects are, what relationships matter, and what rules govern the model. Arithmetic is usually simple after the model is right.

Set Theory as the Foundation

A set is a collection of elements. The universe is the full context under discussion. The union A union B includes elements in A, in B, or in both. The intersection A intersection B includes only elements in both. The complement of A includes elements in the universe that are not in A. The two-set inclusion-exclusion rule is n(A union B) = n(A) + n(B) - n(A intersection B). The subtraction prevents double counting the overlap.

Worked example: In a group of 80 students, 42 take statistics, 31 take computer science, and 18 take both. The number taking at least one of the two courses is 42 + 31 - 18 = 55. The number taking neither is 80 - 55 = 25. A common distractor is 42 + 31 = 73, which counts the 18 students in both courses twice. Another distractor is 80 - 18 = 62, which removes only the overlap and ignores students in exactly one course.

Matrices and Vectors

A matrix is a rectangular array. Matrix addition is defined only when matrices have the same dimensions, and it is performed entry by entry. Scalar multiplication multiplies every entry by the scalar. Matrix multiplication has a different rule: an m x n matrix can multiply an n x p matrix, producing an m x p matrix. The inner dimensions must match. This dimension check should happen before any arithmetic.

Matrices can represent systems, transformations, data tables, or networks. If rows represent stores and columns represent products, an entry can represent inventory count. Multiplying by a price vector can compute revenue totals, but only if dimensions and meanings align. Teacher-level reasoning includes units: a row of item counts times a column of dollars per item yields dollars, not items.

A vector has magnitude and direction, often represented by components. In the plane, <3, 4> can represent a displacement 3 units right and 4 units up, with magnitude 5 by the Pythagorean theorem. Vectors add componentwise because displacements combine by horizontal and vertical changes. A common trap is adding magnitudes instead of components. Two vectors of lengths 5 and 5 do not always sum to length 10; direction matters.

Graphs and Networks

A network graph uses vertices and edges. A path is a sequence of connected edges. A cycle starts and ends at the same vertex without needing to repeat every edge. A degree of a vertex is the number of edges incident to it. In a scheduling graph, an edge might mean two events conflict and cannot occur at the same time. In a prerequisite graph, a directed edge can show that one course must come before another. In a route graph, edge weights can represent distance or time.

Worked example: Four tasks A, B, C, and D must be scheduled. A must happen before C, B must happen before C, and C must happen before D. A directed graph with arrows A -> C, B -> C, and C -> D shows the constraints. Valid schedules include A, B, C, D and B, A, C, D. A schedule such as A, C, B, D violates the B -> C prerequisite. The issue is not alphabetical order; it is respecting directed edges.

Bringing It Together

Discrete structures often combine. A Venn diagram can support probability. A matrix can encode a graph by placing 1 when two vertices are connected and 0 when they are not. A vector can represent movement along a coordinate grid. A set can define the allowable vertices or outcomes. AEPA multiple-choice questions may present a table or diagram and ask for the correct interpretation. Before calculating, name the objects, the relationships, and the rule for combining them.

For students, the main misconceptions are structural. They may think "or" excludes overlap, assume matrix multiplication is entry-by-entry, ignore dimensions, count the same arrangement twice, or treat directed relationships as reversible. The teacher response should make the representation visible: draw the universe for sets, label rows and columns for matrices, mark arrows for directed graphs, and attach units to vectors. That is the mathematical communication AEPA is likely to value.