Excursions In Modern Mathematics, 9th Edition
9th Edition
ISBN: 9780134494142
Author: Tannenbaum
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Textbook Question
Chapter 6, Problem 69E
Dirac’s theorem. If G is a connected graph with N vertices
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Ouestion 2
(a) Show that the Petersen graph is nonplanar. [Hint: show that the graph is edge contractible to
Ks).
(b) Write down two induced subgraphs of the Petersen graph.
(c) Show that the simple connected planar graph with 17 edges and 10 vertices cannot be properly
coloured with two colours. [Hint: Show that such a graph must contain a triangle. Prove by
contradiction].
(d) Suppose G is a connected, simple finite planar graphs with n > k vertices. Show that G has at
most (n - 2) edges.
(e) Let G be a connected planar graph with 20 vertices each of degree 3. Find the number of
regions in the graph.
(f) Prove that a planar graph with n 2 4 vertices in which every vertex has degree at least 2 has at
least 4 vertices.
Let Vn be the set of connected graphs having n edges, vertex set [n], and exactly one cycle. Form a graph Gn whose vertex set is Vn. Include {gn, hn} as an edge of Gn if and only if gn and hn differ by two edges, i.e. you can obtain one from the other by moving a single edge. Tell us anything you can about the graph Gn. For example,
(a) How many vertices does it have?
(b) Is it regular (i.e. all vertices the same degree)?
(c) Is it connected?
(d) What is its diameter?
Kn,n,n be a complete 3-bipartite graph whose maximal independent sets
are C1 = [n],C2 = [2n] – [n], and C3 = [3n] – [2n].
-
(a) How many edges does Kn,n,n have?
(b) Does Kn,n,n have an Eulerian cycle?
(c) Show by any means that Kn,n,n has a Hamilton cycle.
(d) Let G be the graph that is obtained from Kn,n,n by removing the
edges of your Hamilton cycle. Does G have an Eulerian cycle?
Chapter 6 Solutions
Excursions In Modern Mathematics, 9th Edition
Ch. 6 - For the graph shown in Fig. 6-19, a.find three...Ch. 6 - For the graph shown in Fig. 6-20, a.find three...Ch. 6 - Find all possible Hamilton circuits in the graph...Ch. 6 - Find all possible Hamilton circuits in the graph...Ch. 6 - For the graph shown in Fig.6-23, a. find a...Ch. 6 - For the graph shown in Fig.6-24, a. find a...Ch. 6 - Suppose D,G,E,A,H,C,B,F,D is a Hamilton circuit in...Ch. 6 - Suppose G,B,D,C,A,F,E,G is a Hamilton circuit in a...Ch. 6 - Consider the graph in Fig. 6-25. a. Find the five...Ch. 6 - Consider the graph in Fig.6-26. a. Find all the...
Ch. 6 - Consider the graph in Fig.6-27. a. Find all the...Ch. 6 - Prob. 12ECh. 6 - For the graph in Fig.6-29 a. find a Hamilton path...Ch. 6 - For the graph in Fig.6-30 a. find a Hamilton path...Ch. 6 - Explain why the graph shown in Fig.6-31 has...Ch. 6 - Explain why the graph shown in Fig.6-32 has...Ch. 6 - For the weighted shown in Fig 6-33, a.find the...Ch. 6 - For the weighted graph shown in Fig6-34, a.find...Ch. 6 - For the weighted graph shown in Fig6-35, a.find a...Ch. 6 - For the weighted graph shown in Fig6-36, a.find a...Ch. 6 - Suppose you have a supercomputer that can generate...Ch. 6 - Suppose you have a supercomputer that can generate...Ch. 6 - Prob. 23ECh. 6 - a. How many edges are there in K200? b. How many...Ch. 6 - In each case, find the value of N. a. KN has 120...Ch. 6 - In each case, find the value of N. a. KN has 720...Ch. 6 - Find an optimal tour for the TSP given in...Ch. 6 - Find an optimal tour for the TSP given in...Ch. 6 - A truck must deliver furniture to stores located...Ch. 6 - A social worker starts from her home A, must visit...Ch. 6 - You are planning to visit four cities A, B, C, and...Ch. 6 - An unmanned rover must be routed to visit four...Ch. 6 - For the weighted graph shown in Fig.6-41, i find...Ch. 6 - A delivery service must deliver packages at...Ch. 6 - Prob. 35ECh. 6 - A space mission is scheduled to visit the moons...Ch. 6 - This exercise refers to the furniture truck TSP...Ch. 6 - This exercise refers to the social worker TSP...Ch. 6 - Darren is a sales rep whose territory consists of...Ch. 6 - The Platonic Cowboys are a country and western...Ch. 6 - Find the repetitive nearest-neighbor tour and give...Ch. 6 - Prob. 42ECh. 6 - This exercise is a continuation of Darrens sales...Ch. 6 - This exercise is a continuation of the Platonic...Ch. 6 - Prob. 45ECh. 6 - Prob. 46ECh. 6 - Find the cheapest-link tour and give its cost for...Ch. 6 - Find the cheapest-link tour for the social worker...Ch. 6 - For the Brute-Force Bandits concert tour discussed...Ch. 6 - For the weighted graph shown in Fig.6-47, find the...Ch. 6 - For Darrens sales trip problem discussed in...Ch. 6 - For the Platonic Cowboys concert tour discussed in...Ch. 6 - A rover on the planet Mercuria has to visit six...Ch. 6 - A robotic laser must drill holes on five sites A,...Ch. 6 - Prob. 55ECh. 6 - Prob. 56ECh. 6 - Suppose that in solving a TSP you find an...Ch. 6 - Prob. 58ECh. 6 - Prob. 59ECh. 6 - Prob. 60ECh. 6 - Prob. 61ECh. 6 - If the number of edges in K500 is x and the number...Ch. 6 - Explain why the cheapest edge in any graph is...Ch. 6 - a. Explain why the graph that has a bridge cannot...Ch. 6 - Julie is the marketing manager for a small...Ch. 6 - 66. m by n grid graphs. An m by n grid graph...Ch. 6 - Complete bipartite graphs. A complete bipartite...Ch. 6 - Prob. 68ECh. 6 - Diracs theorem. If G is a connected graph with N...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Help with question 3(a)arrow_forwardDiscrete Mathematicsarrow_forwardOn Hamiltonian cycles. (a) Define Hamiltonian cycle. (b) Prove that a graph on n vertices, n ≥ 3, such that the degree of every vertex is ≥ n/2, has a Hamiltonian cycle. (c) Is it needed to assume that G is connected in item (b)?arrow_forward
- Show all calculationarrow_forwardLet G be a simple graph with nonadjacent vertices v and w, and let G+e denote the simple graph obtained from G by creating a new edge, e, joining v and w. Prove that x(G) = min{x(G+e), x((G+e) 4e)}.arrow_forwardLet G be a simple connected graph with n vertices and 1/2(n-1)(n-2)+2 edges. Use Ore's theorem to prove that G is Hamiltonian.arrow_forward
- Determine whether G and H are isomorphic? Also find Euler circuit, Euler trail and Hamiltonian circuit in the graph H, if possible?arrow_forwardUsing mathematical induction on the number of edges prove Euler's formula: r = e -- v + 2 for connected planar simple (CPS) graphs, where r, e, and v are the number of regions, edges, and vertices, respectively. (Hint: Any planar representation of CPS graph can be constructed starting with a single vertex and then successively adding an edge and a vertex or adding an edge between existing vertices as long as it doesn't cross another edge.)arrow_forwardDiscreet math, combinatorics and graphsarrow_forward
- Graph theoryarrow_forwardSuppose that G is a simple digraph. (a) Prove that if k= max{5+,6} > 0, then G contains a directed cycle of length at least k + 1. (b) Prove that if ev(v-1), then G contains a directed cycle. (c) Construct a simple digraph with = v(v-1) such that it contains no directed cycle.arrow_forwardSuppose a graph G has 22 vertices. What is the minimum number of EDGES that G must contain if Dirac's Theorem can be used to guaranteea Hamiltonian Grat in G?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:Cengage
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Algebra & Trigonometry with Analytic Geometry
Algebra
ISBN:9781133382119
Author:Swokowski
Publisher:Cengage
Orthogonality in Inner Product Spaces; Author: Study Force;https://www.youtube.com/watch?v=RzIx_rRo9m0;License: Standard YouTube License, CC-BY
Abstract Algebra: The definition of a Group; Author: Socratica;https://www.youtube.com/watch?v=QudbrUcVPxk;License: Standard Youtube License