9/18/25, 7:45 PM WGU Discrete Mathematics I - C959 Unit 6 Relations EXAM Questions and Answers (Verified Answers) (Latest Update 2025) UPD…
WGU Discrete Mathematics I - C959 Unit 6
Relations EXAM Questions and Answers (Verified
Answers) (Latest Update 2025) UPDATE!!
Save
Practice questions for this set
Learn 1 /7 Study with Learn
Terms in this set (70)
The binary relation, R, is a subset of the product of
Binary Relation two sets. Given sets A and B, for a ∈ A and b ∈ B, (a, b)
∈ is denoted aRb.
A binary relation, R, between two sets A and B, can be
Arrow Diagram
represented graphically using an arrow diagram.
https://quizlet.com/1078781928/wgu-discrete-mathematics-i-c959-unit-6-relations-exam-questions-and-answers-verified-answers-latest-update-2025-u… 1/6
, 9/18/25, 7:45 PM WGU Discrete Mathematics I - C959 Unit 6 Relations EXAM Questions and Answers (Verified Answers) (Latest Update 2025) UPD…
A matrix is a rectangular array of ones (1) and zeros
(0). To represent the binary relation, R, between sets A
and B in a matrix: Create an array where the number
Matrix Representation
of elements in A equals the number of rows and the
number of elements in B equals the number of
columns.
If an element maps to itself, a self-loop is drawn,
Self-loop which leaves and returns to the same element in a
'loop.'
A directed graph or digraph consists of two sets: V
Directed Graph
(vertices) and E (edges).
Vertices, set V, are visually represented by a labeled
Vertices dot or circle. The elements, u and v ∈ V, are the head
and tail (respectively) of the 'edge.'
Set E, the edges, are a subset of V x V. Visually, the
Edges 'edges,' are the arrows diagramed from one vertex, v
(the tail), to another vertex, u (the head).
Description of a vertex; it is the number of edges
Indegree
pointing into it.
Description of a vertex; it is the number of edges
Outdegree
pointing out of it.
Walks within a directed graph are made up of a
Walk number of sequential edges whose head is the tail of
the previous edge.
Length of Walk The number of edges contained in the walk.
A walk where the first and last vertices are not the
Open Walk
same.
Closed Walk A walk where the first and last vertices are the same.
Trail An open walk, but no edge occurs more than once.
Path A trail without repeated vertices.
https://quizlet.com/1078781928/wgu-discrete-mathematics-i-c959-unit-6-relations-exam-questions-and-answers-verified-answers-latest-update-2025-u… 2/6
WGU Discrete Mathematics I - C959 Unit 6
Relations EXAM Questions and Answers (Verified
Answers) (Latest Update 2025) UPDATE!!
Save
Practice questions for this set
Learn 1 /7 Study with Learn
Terms in this set (70)
The binary relation, R, is a subset of the product of
Binary Relation two sets. Given sets A and B, for a ∈ A and b ∈ B, (a, b)
∈ is denoted aRb.
A binary relation, R, between two sets A and B, can be
Arrow Diagram
represented graphically using an arrow diagram.
https://quizlet.com/1078781928/wgu-discrete-mathematics-i-c959-unit-6-relations-exam-questions-and-answers-verified-answers-latest-update-2025-u… 1/6
, 9/18/25, 7:45 PM WGU Discrete Mathematics I - C959 Unit 6 Relations EXAM Questions and Answers (Verified Answers) (Latest Update 2025) UPD…
A matrix is a rectangular array of ones (1) and zeros
(0). To represent the binary relation, R, between sets A
and B in a matrix: Create an array where the number
Matrix Representation
of elements in A equals the number of rows and the
number of elements in B equals the number of
columns.
If an element maps to itself, a self-loop is drawn,
Self-loop which leaves and returns to the same element in a
'loop.'
A directed graph or digraph consists of two sets: V
Directed Graph
(vertices) and E (edges).
Vertices, set V, are visually represented by a labeled
Vertices dot or circle. The elements, u and v ∈ V, are the head
and tail (respectively) of the 'edge.'
Set E, the edges, are a subset of V x V. Visually, the
Edges 'edges,' are the arrows diagramed from one vertex, v
(the tail), to another vertex, u (the head).
Description of a vertex; it is the number of edges
Indegree
pointing into it.
Description of a vertex; it is the number of edges
Outdegree
pointing out of it.
Walks within a directed graph are made up of a
Walk number of sequential edges whose head is the tail of
the previous edge.
Length of Walk The number of edges contained in the walk.
A walk where the first and last vertices are not the
Open Walk
same.
Closed Walk A walk where the first and last vertices are the same.
Trail An open walk, but no edge occurs more than once.
Path A trail without repeated vertices.
https://quizlet.com/1078781928/wgu-discrete-mathematics-i-c959-unit-6-relations-exam-questions-and-answers-verified-answers-latest-update-2025-u… 2/6
