Purchase Solution

Euler Digraph: Characterization

Not what you're looking for?

Ask Custom Question

Page 90, Theorem 4.6 ( To show that a digraph is hamiltonian if and only if for each vertex v, indegree (v) =outdegree (v)

Page 92 Exercise problem 4.1 ( A modified version of konigsberg problem where, two extra bridges are built. )

Page 93, Figure 4.5 need to show as Hamilton. (Show that dodecahedron is hamiltonian)

See attached file for full problem description.

Attachments
Purchase this Solution
Solution Summary

Here we prove the Necessary and sufficient condition for a digraph to be Eulerian. It also solves three problems from Graphs and Digraphs concerning a modified Konigsberg problem and provide a Hamiltonian cycle for dodecahedron.

Solution Preview

Problem 4.1 and 4.5, I have attached figures.

Problem 4.1:
-------------
We construct a graph of the present day Konigsberg bridges and see that there are exactly two vertices (A and B) have odd degree. We know that every connected graph with exactly 2 odd vertices have an Eulerian tour starting and ending at these vertices. Hence we can device such a route passing through all the edges. The attached figure shows such a route.

Problem of figure 4.5
--------
We need to show the graph of dodecahedron is Hamiltonian. We do this by providing such a cycle explicitly. In the attached figure, follow the vertex sequence 1,2,3,...,19,20,1 which is such a Hamiltonian cycle.

Theorem 4.6
-------------
Theorem: Let D be a connected non-trivial digraph. D is Eulerian if and
only if id(v) = od(v) for every vertex. (id:in degree, od:out degree).

Proof:
A trail in a graph is a path without repeated edges.

Suppose D is Eulerian. Consider any ...

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.

Multiplying Complex Numbers

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

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Exponential Expressions

In this quiz, you will have a chance to practice basic terminology of exponential expressions and how to evaluate them.

Probability Quiz

Some questions on probability

View More Free Quizzes
Related BrainMass Solutions

  • Double Eulerian tour

    The following two theorems of Euler and Hierholzer give a complete characterization of connected multigraphs G with Eulerian circuits (see Main Corollary below). Theorem 1 (Euler, 1736).

  • Mathematics - Descrete Mathematics - Digraph, Connectivity

    We have to draw the digraph of the transitive closure of R and use the digraph to explain connectivity. For complete description of the problem, please see the attached problem file.

  • Connected digraph proof

    98608 Prove Let D be a nontrivial connected digraph. 4.4 Prove Let D be a nontrivial connected digraph. Then D is Eulerian if and only if od(v)=id(v) for every vertex v of D. Od means the outdegree of a vertex v of a digraph D.

  • Cayley Digraph

    152029 Cayley Digraph Can you graph this Cayley Digraph in the attachment? Please see the attached file for the complete solution. A Cayley digraph is plotted in a graph in the solution.

  • Find a circuit using a Cayley digraph.

    This is the cayley digraph of You have to follow the direct arrow. I will give you such a circuit as follows. A Cayley digraph is used to find a circuit is examined.

  • Ordered Pairs and Digraph

    Given the following information, create the appropriate Digraph Let X = {1, 3, 4, 6} Let Y = {1, 2, 3, 5, 7} 3. Create a Digraph that describes the Binary Relation x < y. For example, (1,3) would be a member of the Relation. 1.

  • Question about Relation - Ordered Pairs

    (e) Draw the digraph of the transitive closure of R and use the digraph to explain the idea of connectivity. Is this graph connected? What does connectivity mean? Please see the attachment.

  • Discrete Math: Warshall's Algorithm

    Draw the digraph of the transitive closure of R and use the digraph to explain the idea of connectivity. Is this graph connected? What does this mean? Please see the attachment. Transitive closure is determined using Warshall's Algorithm.

  • Question about Ordered Pairs

    Let A = {a, b, c} , and let R be the relation defined on A defined by the following matrix: MR = Describe R by listing the ordered pairs in R and draw the digraph of this relation.

View More Related Solutions