Discrete Math Final
Home > Preview
The flashcards below were created by user
on FreezingBlue Flashcards.
A graph in which each edge connects two different vertices and where no two edges connect the same pair of vertices. (Only one edge between any two vertices and no sense of direction)
A simple graph in which there are several edges connecting at least one vertex to another; does not include self loops.
A multigraph which includes edges that connect a vertex to itself
Simple Directed Graph
A simple graph where edges imply a sense of direction
A graph where each edge implies a direction and multiple edges between vertices exist.
How can you find the maximum number of edges in a graph?
Where n is the number of edges, (n*(n-1))/2
Two vertices that have an edge between them.
For every element a in the set S, (a,a) is an element in the relation on S called R. (a is an element of S implies (a,a) is an element of R).
A relation is said to be symmetric if for every element (a, b) in R there also exists an element (b, a).
A relation is said to be anti-symmetric if for any element (a,b) in R there does not exist (b,a) unless a = b.
A relation R is said to be transitive if whenever (a, b) is an element of R and (b, c) is an element of R, then (a, c) is an element of R.
What would you like to do?
Home > Flashcards > Print Preview