Scribd
Upload
22 views4 pages

Deg (V I) 2 M: Path Length Is The Number of Edges (N) That The Path Contains

- The document provides notes from a MAT214A class on Friday April 5th, 2019 from 10:50 am to 12:05 pm. - It covers topics like degree notation, necessary conditions for graphs, paths and cycles, Hamiltonian cycles, and the traveling salesperson problem. - Key definitions include path, cycle, simple path, simple cycle, connected graph, subgraph, and component of a graph. Necessary conditions for graphs include that the sum of all vertex degrees must be even and the number of vertices of odd degree must be even. - Hamiltonian cycles are more difficult to determine than Euler cycles as there are fewer rules to help, but three rules are provided to help construct or disprove the existence

Uploaded by

goflux pwns
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
22 views4 pages

Deg (V I) 2 M: Path Length Is The Number of Edges (N) That The Path Contains

- The document provides notes from a MAT214A class on Friday April 5th, 2019 from 10:50 am to 12:05 pm. - It covers topics like degree notation, necessary conditions for graphs, paths and cycles, Hamiltonian cycles, and the traveling salesperson problem. - Key definitions include path, cycle, simple path, simple cycle, connected graph, subgraph, and component of a graph. Necessary conditions for graphs include that the sum of all vertex degrees must be even and the number of vertices of odd degree must be even. - Hamiltonian cycles are more difficult to determine than Euler cycles as there are fewer rules to help, but three rules are provided to help construct or disprove the existence

Uploaded by

goflux pwns
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

MAT214A

Friday 4/5
Spring 2019 10:50 am – 12:05 pm
 Homework for Section 8-2: #1-18 even, 22-26 all, 28-32, 35, 36, 42, 46, 48, 49
 Quiz on 8.1 – 8.2 today

Note: Degree of vertex v notation


The book uses ẟ(v) for degree of vertex. The letter ẟ is a lower case delta. Many books write deg(v) to
designate the degree of a vertex. Either notation is fine.

Necessary condition for graphs:


n
 If a graph has m edges and vertices {v1, v2, v3, ….vn}, then ∑ deg ⁡(v ¿¿ i)=2 m ¿
i=1
 The sum of the degrees of all vertices must be even.
 The number of vertices of odd degree must be even.
 If a graph is a simple graph, then the maximum degree for any vertex is n – 1, n being the number of
vertices in the graph
Questions on #10-18?
#16 in class

Section 8-2 Paths and Cycles


Let v and w be vertices of a graph.
Path: A path from v to w of length n, is an alternating sequence of n + 1 vertices and n edges. Notice that the
definition in this book allows repetitions of vertices or edges or both. This is not always the case – check
definitions in other textbooks.
Path Length is the number of edges (n) that the path contains.
Simple path: path from v and w with no repeated vertices.
Cycle: a path of nonzero length from v to v with no repeated edges.
Simple Cycle: a cycle from v to v in which there are no repeated vertices – except for beginning and end at v.
Connected Graph: given any vertices v and w, there is a path from v to w
Subgraph of G: A subgraph of a graph G is a graph whose set of vertices and set of edges are all subsets of G.
Component of a Graph: A subgraph in which any two vertices are connected to each other by paths, but
which are not connected to other vertices in the parent graph.
A graph that is itself connected has exactly one component, consisting of the whole graph.

Component versus Subgraph


One standard way to categorize graphs is as connected or disconnected. A disconnected graph can be
decomposed into a series of graphs that are not connected to each other. I would refer to one of those as a
component. A subgraph on the other hand is a subset of vertices of the original graph along with a subset of
edges.
Today:

Each path had a weight. The puzzle was to visit each city (vertex) only once for the lowest possible
cost/distance etc.

Section 8-3 Hamiltonian Cycles and Traveling Salesperson Problem


Section 8-2 discussed Euler Cycles: is it possible to start and end at same vertex traveling each edge only once?
There were some rules and a theorem to help us with this:
 If a graph G has a Euler cycle, then G is connected and every vertex has an even degree.
 If a graph G has a Euler path, then G is connected and two vertices will have odd degree, the remaining will
have even degree.
Questions like: can I plow the neighborhood streets without repeating streets?

Section 8-3 Discusses Hamiltonian Cycles: is it possible to start and end at same vertex visiting each vertex
only once (other than start and end vertex)?
There are not many rules to help us with this.
Questions like: can I travel to each city only once, without passing through an already visited city?

Hamiltonian Path is a path that visits each vertex only once and starts and ends at different vertices.
Hamiltonian Cycle is a closed path – starts and ends at same vertex – that visits each vertex only once.
[Cycles are harder to achieve than paths, just remove an edge of a cycle to get a path.]
It seems like finding a Hamilton circuit (or conditions for one) should be more-or-less as easy as a Euler cycle.
Unfortunately, it's much harder.
Which of the following have Hamiltonian Cycles?

There are 3 rules that can be applied to either construct a Hamilton cycle or show that no Hamilton cycle
exists:
Rule 1: If a vertex v has degree 2, both of the edges touching vertex v must be part of any Hamilton cycle.
Rule 2: During the construction of a Hamiltonian cycle, no cycle can be formed until all of the vertices have
been visited
Rule 3: Once a Hamilton cycle is required to use 2 edges at a vertex v, all other (unused) edges touching v can
be ignored (removed), as they cannot be used in the Hamilton circuit.
Careful here! Avoid double counting when removing edges
Note: a simple connected graph with n vertices and at least n edges contains a cycle.
Examples on removing surplus edges – careful not to double count
See page 397 figure 8.3.5 and figure 8.3.6

Goal:
Construct a Hamiltonian cycle or show at some point during the construction that it is impossible to proceed
any further.

----------------------------------------------stopped here --------------------------------------------

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy