Purchase Solution

Discrete math - graphs and relations

Not what you're looking for?

Ask Custom Question

Question for 8.1:

Let G be a simple graph. Show that the relation R on the set of vertices of G such that uRv if and only if there is an edge associated to {u,v} is a symmetric, irreflexive relation on G.

Question for 8.2:

Show that a simple graph with at least two vertices there must be 2 vertices that have the same degree.

(see attached for more: 52, 48, 16, 51, 29)

Attachments
Purchase this Solution

Solution Summary

This provides examples of a few different topics, including simple graphs, Hamilton circuits, bipartite graph, relations, and binary trees.

Purchase this Solution


Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Probability Quiz

Some questions on probability

Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.