Scribd
Upload
12 views3 pages

MMW Graph

This document discusses graph theory concepts. It defines a graph as consisting of a set of vertices and edges. It notes that vertices are adjacent if joined by an edge, and edges are adjacent if they share a common vertex. The degree of a vertex is the number of edges at that vertex. A path in a graph is a sequence of vertices without repeated edges, while a circuit starts and ends at the same vertex. Euler's theorems state conditions for when a graph can have an Euler path or circuit based on the degrees of its vertices.

Uploaded by

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

MMW Graph

This document discusses graph theory concepts. It defines a graph as consisting of a set of vertices and edges. It notes that vertices are adjacent if joined by an edge, and edges are adjacent if they share a common vertex. The degree of a vertex is the number of edges at that vertex. A path in a graph is a sequence of vertices without repeated edges, while a circuit starts and ends at the same vertex. Euler's theorems state conditions for when a graph can have an Euler path or circuit based on the degrees of its vertices.

Uploaded by

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

Lesson 6: Graph Theory

Graph Concepts
Note:
De nition:
a. Vertices are adjacent if there is an edge that
 Let V be a non-empty set and E be any set joins them. Similarly, Edges are adjacent if
of ordered pairs over V. (V, E) is called graph there share a common vertex.
denoted by G = (V, E). b. The degree of vertex is the number of edges
- V is vertex set of G and its elements are at that vertex.
vertices. c. Special Case: For graphs w/ loops, you must
- E is edge set of G and its elements are add 1 to the degree of the vertex with
edges. loops.
Example #1 Example #1

Example #2 Example #2

Example #3 Example #3
Moreover, we can visualize graphs thru the .
 Given a graph G = (V, E). A path in G is a models.
sequence of vertices w/ no repeated edges.
 Given a graph G = (V, E). A circuit in G is a path
that starts and ends at the same vertex.

Example for paths

Example for circuit

 A graph is connected if there is a path


joining any two of its vertices. Otherwise,
disconnected.

Example#1
Euler Path & Euler Circuit Euler’s Theorem 2

 Given a connected graph G. An edge in G is 1. If a graph has more than two vertices of odd
bridge if G becomes disconnected when it is degree, then it cannot have a Euler path.
deleted. 2. If a graph is connected and has just two
- A Euler path is a path that travels vertices of odd degree, then it has at least
through every edge of G. one Euler path. Any such path must start at
- A Euler circuit is a circuit that travels one of the degree vertices and end at the
through every edge of G. other one.

Example #1 Example

Euler’s Theorem 3

1. The sum of degrees of all the vertices of a


graph equals twice the number of edges.
2. The number of vertices of odd number
must be even.

Example

Euler’s Theorem 1

1. If a graph has any vertices of odd degree,


then I cannot have a Euler circuit.
2. If a graph is connected and every vertex has
an even degree, then it has at least one
Euler circuit.

Example #1

You might also like