Scribd
Upload
12 views20 pages

Mathematics of Graphs

Uploaded by

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

Mathematics of Graphs

Uploaded by

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

MATHEMATIC OF GRAPHS

What is a Graph?

Graph is a set of vertices


(points/dots) and edges
(line segments or curves).
Examples
A B
1.

C D

A B D
2. C

3. A
B C D

E
Basic Terms Used in Graph
Theory
• Degree of a vortex. It refers to the number of edges that emanate
from that vertex. A B
A B
• Examples:

C
D C D

• Walk in a graph. It is movement from one vertex to other vertices


passing through their edges.
A B
• Examples:

C D
A-B-C, B-C-D, A-B-C-D
Basic Terms Used in Graph
Theory
• Circuit. It is walk in a graph that starts and ends on the same
vertex.
• Example: C
A
A-B-C-D-A
D-E-C-D
A-B-C-E-D-A E
B-C-E-D-A-B D
B

• Eulerian Circuit. It is a circuit which traverses all edges only


•once.
Example: A C D

A-B-C-E-D-C-A
C-E-D-C-A-B-C

B
E
Weighted Graphs

Weighted Graph
• Graph in which each edge is
associated with a value, called
a weight
• Value can represent any
quantity
Weighted Graphs
Components
1. Vertices (Nodes)
These are the points or
locations
in the graph.
2. Edges (Links)
These are the connections
between
vertices.
3. Weights
Each edge has a numerical
value
Weighted Graphs
Components
1. Vertices (Nodes)
These are the points or
locations
in the graph.
2. Edges (Links)
These are the connections
between
vertices.
3. Weights
Each edge has a numerical
value
Weighted Graphs
Example:
Suppose a traveler would like to
start in Chicago, visit the other
five cities this airline flies to, and
return to Chicago. Find three
different routes that the traveler
could follow, and find the total
distance flown for each route
Planar Graphs
Planar graphs are graphs that can be drawn without any
overlapping edges
• It may be necessary to redraw a graph so that you can identify if
it’s a planar or not
• All simple graphs with 4 or fewer vertices are planar
• Any complete graph with 5 or more vertices is non-planar
Planar Graphs
3 key components of planar graphs

1. Edges
2. Vertices
3. Faces (or regions)

• Regions within and about a planar


graph
• Graphs must be drawn as planar
before you can identify faces
Drawing graphs as planar

• Consider the edges that overlap – can


one be redrawn around the ‘outside’?
• Consider the vertex that could be
causing the overlap – can it be moved?
• For more complex graphs, label the
vertices and note the degree of each
Euler’s Formula
Euler’s formula is used to verify that a graph is connected
and planar
v–e+f=2
• You will be expected to use this formula to verify planar status, or
given some information about a graph determine the number of
edges, vertices or faces
Euler’s Formula
Example:
A planar graph has five vertices and six faces. How many
edges does this graph contain?
Graph Coloring
• Graph coloring started in the mid-1800’s
• Francis Guthrie tried to color the map of England so that it
would be easy to distinguish the countries sharing a
common border
• Countries with the same border must have different color.
• In graph coloring each vertex of a graph will be assigned
one color, no two adjacent vertices have the same color
• A practical application of the graph coloring problem is in
scheduling meetings or events
Graph Coloring
Chromatic Number
- The minimum number of colors needed to color a graph
so that no edge connects vertices of the same color.
2 Colorable Graph Theory
- A graph is 2-colorable it and only if it has no circuits that
consist of an odd number vertices
Four-Color Theorem
- The Chromatic number of a planar graph is at most 4
Graph Coloring
Example:
Consider the complete graphs K4 and K5. Determine their
chromatic number.
Graph Coloring
Example:
Six student clubs need to hold meetings on the same day,
but some students belong to more than one club. In order to
avoid members missing meetings, the meetings need to be
scheduled during different time slots. An "X" in the table
below indicates that the two corresponding clubs share at
least one member. Use graph coloring to determine the
minimum number of time slots necessary to ensure that all
club members can attend all meetings.
Graph Coloring
Graph Coloring
• Take minimum numbers of colors and
assign them to the vertices of the
given figure. Reuse the colors to draw
the graph.

• The minimum number of colors used


has been obtained as 2.

• The color represents the time slot, so


the minimum number of time slots
require is 2.

You might also like