Scribd
Upload
418 views21 pages

Advance Graph Theory

This document provides an introduction to advanced graph theory concepts. It begins with elementary concepts such as defining a graph using vertices and edges. It then discusses the invention of graph theory through solving the Konigsberg bridge problem. Finally, it covers various graph theory terms and concepts such as directed vs undirected graphs, loops, multiple edges, isolated vertices, incidence, adjacency, and types of graphs like connected, acyclic, weighted graphs and null graphs.

Uploaded by

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

Advance Graph Theory

This document provides an introduction to advanced graph theory concepts. It begins with elementary concepts such as defining a graph using vertices and edges. It then discusses the invention of graph theory through solving the Konigsberg bridge problem. Finally, it covers various graph theory terms and concepts such as directed vs undirected graphs, loops, multiple edges, isolated vertices, incidence, adjacency, and types of graphs like connected, acyclic, weighted graphs and null graphs.

Uploaded by

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

Advanced Graph Theory

CSE 6101
Elementary Concepts
• A graph is represented with dots or circles
(vertices) joined by lines (edges)
• The magnitude of graph G is characterized by
number of vertices |V| (called the order of G)
and number of edges |E| (size of G)
• The running time of algorithms are measured
in terms of the order and size
The invention process of Graph Theory.
The invention process of Graph Theory.
More germaine example (this is widely thought to be how graph theory
originated) is found in a puzzle that was posed by the townsfolk of
Konigsberg, Prussia in the early 1700’s. Konigsberg (now known as
Kaliningrad) was built largely on an island in the Pregel river, this island sits
near where two branches of the river join, and the borders of the town
spread over to the banks of the river as well as a nearby promontory.
Between these four land masses, seven bridges had been erected. See
Figure 2. The townspeople supposedly posed the question “Is it possible to
take a walk through town, crossing each of the seven bridges just once, and
ending up wherever you started?” The famous swiss mathematician
Leonhard Euler (pronounced “Oiler”) heard of the problem, solved it (it’s
not possible) and in the process invented Graph Theory. Since the question
involved the connection of land masses by bridges, Euler realized that all
the points on the island (for example) were equivalent as far the question
was concerned, so the island as well as the banks and the promontory
could be represented with single points. In Figure 3 we see what
Konigsberg and its bridges look like in Euler’s abstracted version.
1
2
6
5

3 7
4

e1 e6
e2

e5
e4
e7
e3
Vertex
Edge
Graph
Practical problems involve Graph theory

 How can n jobs be filled by n people with maximum


utility?
 How can the season of a sports league be scheduled
into the minimum number of weeks?
 In what order should a traveling salesman visit cities
to minimize travel time?
 Can we color the regions of every map using four
colors so that neighboring regions receive different
colors?
order

size

size

size

order size
Loop
a vertex being connected to itself. Such edges are called loops in the
graph G i.e two endpoints of an edge are the same vertex. This is called a loop

Multiple Edges
multiple edges which is when more than one edge shares the same set of
endpoints, i.e. the edges of the graph are not uniquely determined by their
endpoints.
Simple Graph

graphs that have neither loops nor multiple copies of the same edge (these are known as
parallel edges). Such graphs are called simple graphs.
In this case, each edge e in E(G) can be specified by its endpoints u; v in V (G). Sometimes
we write e = uv.
Undirected graph
The edges are unordered pairs of V (i.e. the binary relation is symmetric).
– Ex: undirected G(V,E); V = {a,b,c}, E = {{a,b}, {b,c}}

Directed graph (digraph)


The edges are ordered pairs of V (i.e. the binary relation is not necessarily symmetric).
– Ex: digraph G(V,E); V = {a,b,c}, E = {(a,b), (b,c)}

a a
b b
c c
A directed graph having no multiple edges or loops is called a simple directed graph.
Undirected graph Directed graph

loop loop

G=(V,E)
isolated vertex
adjacent
multiple
edges

• incidence: an edge (directed or undirected) is incident to a vertex that is one


of its end points.
• degree of a vertex: number of edges incident to it
– Nodes of a digraph can also be said to have an indegree and an outdegree
• adjacency: two vertices connected by an edge are adjacent
Types of graphs
• multi-graph: any graph that is not simple
• connected graph: all vertex pairs are joined by a path
• disconnected graph: at least one vertex pairs is not joined by a
path
• complete graph: all vertex pairs are adjacent
– Kn: the completely connected graph with n vertices
a
a e
b
e
b
K5
d
c d
Disconnected graph
Connected graph with two components c
Types of graphs
• acyclic graph (forest): a graph with no cycles
• directed acyclic graph (DAG): a digraph with no cycles
• weighted graph: any graph with weights associated with the edges (edge-
weighted) and/or the vertices (vertex-weighted)

b 10 a

5
d 8 c

2 -3
e f
6
Null Graphs
A null graphs is a graph containing no edges. The null graph with n vertices is denoted
by Nn.
The following are the examples of null graphs.

You might also like