The parts of this exercise outline a proof of Ore's theorem. Suppose that G is a siraplegraph withnvertices,
a) Show that if G does not have a Hamilton circuit, then there exists another graph if with the same vertices as G, which can be constructed by adding edges to G, such that the addition of a single edge would produce a Hamilton circuit inH. [Hint:Add as many edges as possible at each successive vertex of G without producing a Hamilton circuit.]
b) Show that there is a Hamilton path in H.
e) Let v1, v2,...,vnbe a Hamilton path in H. Show that deg(v1) +deg(vn)
JULIUS PETER CHRISTIAN' PETERSEN (1839-1910) Julius Petersen was born in the Danish town of Soro. His father was a dyer. In 1854 his parents were no longer able to pay for his schooling, so he became an apprentice in an uncle:s grocery store. When this uncle died, he left Petersen enough money to return to school. After graduating, he began studying engineering at the Poly technical School in Copenhagen, later deciding to concentrate on mathematics. He published his first textbook, a book on logarithms, in 1858. When his inheritance ran out, he had to teach to make a living. From 1859 until 1.871 Petersen taught at a prestigious private high school in Copenhagen. While teaching high school he continued his studies, entering Copenhagen University in 1862. He married Laura Eertelsen in 1862; they had three children, two sons and a daughter.
Petersen obtained a mathematics degree from Copenhagen University in 1866 and finally obtained his doctorate in 1871 from that school. After receiving his doctorate, he taught at a polytechnic and military academy. In 1887 he was appointed to a professorship at the University of Copenhagen. Petersen was well known in Denmark as the author of a large series of textbooks for high schools and universities. One of his books,MethodsandTheories for the Solution of Problems of Geometrical Construction,was translated into eight languages, with the English language version last reprinted in i960 and the French version reprinted as recently as 1990, more than a century after the original publication date.
Petersen worked in a wide range of areas, including algebra, analysis, cryptography, geometry, mechanics, mathematical economics, and number theory. His contributions to graph theory, including results on regular graphs, are his best-known work. He was noted for his clarity of exposition, problem-solving skills, originality, sense of humor, vigor, and teaching. One interesting fact about Petersen was that he preferred not to read the writings of other mathematicians. This led him often to rediscover results already proved by others, often with embarrassing consequences. However, he was often angry when other mathematicians did not read his writings!
Petersen's death was front-page news in Copenhagen. A newspaper of the time described him as the Hans Christian Andersen of science-a child of the people who made good in the academic world.
d)Let 5 be the set of vertices preceding each vertex adjacent to v1in the Hamilton path. Show thatScontains deg(v1) vertices andvn??S.e) Show that 5 contains a vertex vkthat is adjacent to vn, implying that there are edges connecting v1and vk+1and vkandvn.
Want to see the full answer?
Check out a sample textbook solutionChapter 10 Solutions
Discrete Mathematics and Its Applications ( 8th International Edition ) ISBN:9781260091991
- 2.5 Prove that if a graph has exactly two vertices of odd degree, then there is a path from one of them to the other.arrow_forwardLet G be a graph. Color each of the vertices of G either red or black. Let R be the set of red vertices. If a vertex is red, then it may never become black. However, if the criteria laid out in the following Infection Rule are met, then additional vertices may become red. Infection rule: If • R' is the set of currently red vertices, . C is a component of G - R', •UER', and • v is the unique black neighbor of u in C, then u can infect v and v becomes red. If after a sufficient number of infections every vertex in G is red, then R is an infection set. Definition 0.1. For each graph G, let the infection number of G, denoted I(G), be the graph parameter such that I(G) = min{|R|: R is an infection set of G}. (3) Let T be a tree. Show that I(T) = 1.arrow_forwardI have to prove the following lemma: “Let G be a 2-connected graph. If e and f are parallel edges in G, then G\e is 2-connected.” I was thinking about proving it by showing that there exists a cycle betweent two adjacent vertices u and v such that if we were to delet one of the edges, either e or f, we would remain in a 2-connected graph. I'm not sure if this is correct and even how to word it properly. Please help me with this prove, thank you :)arrow_forward
- How can I prove the following: Let G be a 2-connected graph. If e and f are parallel edges in G, then G\e is 2-connected. (Without deleting edges or vertices. However edge contraction is allowed)arrow_forwardIf G = (V, E) has n > 2 vertices and no self-loops, show that there exist two vertices v # w such that deg(v) = deg(w). Present a counterexample, if G is allowed to have self-loops.arrow_forwardLet G be a connected simple graph in which all vertices have degree 4. Prove that it is possible to color the edges of G red or blue so that every vertex is adjacent to two red edges and two blue edges. Hint: Start by showing that G has a closed Eulerian walk.arrow_forward
- I have to prove the following Corollary: "Let u and v be vertices of a 2-connected graph G. Then there is a cycle of G that contains both u and v.” My idea of the proof is the following: Given vertices u and v, I want to show that there is a cycle containing both. Then by contradiction, I could assume that there exists u and v sucht that there are no cycles C including u and v. However, I'm not quite sure that this is the correct approach. I would appreciate some help to prove this corollary. Thank youuuarrow_forwardLet P₁ and P₂ be two paths of maximum length in a connected graph G. Prove that P₁ and P2 have a common vertex. Let G be a graph of order n and size strictly less than n - - 1. Prove that G is not connected.arrow_forwardThe symmetric difference graph of two graphs G1 = (V, E1) and G2 = (V, E2) on the samevertex set is defined as G1△G2 := (V, E1△E2). Remember that E1△E2 := (E1 \ E2) ∪(E2 \ E1). If G1 and G2 are eulerian, show that every vertex in G1△G2 has even degreearrow_forward
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning