MATH 204 • Discrete Mathematics • Final

Definition of Relation

Example 1

Example 2

Example 3

Example 4

Reflexive Relations

Example 5

Example 6

Symmetric Relations

Antisymmetric Relations

Example 7

Transitive Relations

Example 8

Properties of Relations

Example 9

Example 10

Example 11

Example 12

Example 13

Composition of Relations

Example 14

Example 15

Example 16

Equivalence Relation

Example 17

Example 18

Example 19

Example 20

Example 21

Example 22

Example 23

Example 24

Introduction

Example 1

Graph Terminology

Example 2

Handshaking Theorem

Example 3

Example 4

Special Graphs

Example 5

Example 6

Bipartite Graphs

Example 7

Example 8

Complete Bipartite Graph

Matching

Example 9

Subgraph

Example 10

Subgraph Induced

Edge Contraction

Example 11

Complementary Graph

Example 12

Example 13

Example 14

Adjacency Matrices - Undirected Graphs

Adjacency Matrices - Directed Graphs

Example 15

Example 16

Incidence Matrices

Example 17

Isomorphism of Graphs

Example 18

Example 19

Example 20

Example 21

Definition of Paths and Circuits

Connected Graphs

Euler Paths and Circuits

Example 22

Hamilton Paths and Circuits

Example 23

Example 24

Dijkstra's Algorithm

Example 1

Example 2

Exam Like Question 1

Exam like Question 1

Exam like Question 2

Exam like Question 3

Exam like Question 4

Exam like Question 5

Exam like Question 6

Exam like Question 7

Exam like Question 8

Exam like Question 9

Exam like Question 10

Exam like Question 11

Exam like Question 12

Exam like Question 13

Exam like Question 14

Exam like Question 15

Exam like Question 16

Exam like Question 17

Exam like Question 18

Exam like Question 19

Exam like Question 20

Definitions