Beamer warmup
Graphs
Example of a beamer presentation
(Illustrating some usage)
George McNinch
Department of Mathematics
Tufts University
March 10, 2024
Example of a beamer presentation
Beamer warmup
Graphs
Outline
1 Beamer warmup
2 Graphs
Example of a beamer presentation
Beamer warmup
Graphs
Beamer concepts
A slide is the basic unit for a Beamer slide-show.
I’ve organized this document with sections; each section
contains a few frames.
When the L AT E X file is compiled (say, in O VERLEAF) the
output is a PDF file that has (at least) a page corresponding
to each frame.
Example of a beamer presentation
Beamer warmup
Graphs
Beamer concepts
A slide is the basic unit for a Beamer slide-show.
I’ve organized this document with sections; each section
contains a few frames.
When the L AT E X file is compiled (say, in O VERLEAF) the
output is a PDF file that has (at least) a page corresponding
to each frame.
Example of a beamer presentation
Beamer warmup
Graphs
Beamer concepts
A slide is the basic unit for a Beamer slide-show.
I’ve organized this document with sections; each section
contains a few frames.
When the L AT E X file is compiled (say, in O VERLEAF) the
output is a PDF file that has (at least) a page corresponding
to each frame.
Example of a beamer presentation
Beamer warmup
Graphs
Beamer concepts, p.2
In fact, if there are \pause commands with a frame,
L AT E X will produce multiple pages for the frame, with
material following the \pause greyed out.
Using an application for document display, you can use
the resulting PDF to accompany a presentation.
Example of a beamer presentation
Beamer warmup
Graphs
Beamer concepts, p.2
In fact, if there are \pause commands with a frame,
L AT E X will produce multiple pages for the frame, with
material following the \pause greyed out.
Using an application for document display, you can use
the resulting PDF to accompany a presentation.
Example of a beamer presentation
Beamer warmup
Graphs
Outline
1 Beamer warmup
2 Graphs
Example of a beamer presentation
Beamer warmup
Graphs
Definition of a graph
Let’s give an example of an itemized list:
A graph G = (V, E) consists of a set V of vertices and a set E
of edges.
If G is a directed graph then E is a subset of the Cartesian
product V × V. An element e = (v, w) ∈ E represents an
edge from the vertex v to the vertex w.
If G is an undirected graph, then edges may be represented
in the form e = [v, w] where v, w ∈ V are vertices, and
where [v, w] = [w, v].
Example of a beamer presentation
Beamer warmup
Graphs
Definition of a graph
Let’s give an example of an itemized list:
A graph G = (V, E) consists of a set V of vertices and a set E
of edges.
If G is a directed graph then E is a subset of the Cartesian
product V × V. An element e = (v, w) ∈ E represents an
edge from the vertex v to the vertex w.
If G is an undirected graph, then edges may be represented
in the form e = [v, w] where v, w ∈ V are vertices, and
where [v, w] = [w, v].
Example of a beamer presentation
Beamer warmup
Graphs
Definition of a graph
Let’s give an example of an itemized list:
A graph G = (V, E) consists of a set V of vertices and a set E
of edges.
If G is a directed graph then E is a subset of the Cartesian
product V × V. An element e = (v, w) ∈ E represents an
edge from the vertex v to the vertex w.
If G is an undirected graph, then edges may be represented
in the form e = [v, w] where v, w ∈ V are vertices, and
where [v, w] = [w, v].
Example of a beamer presentation
Beamer warmup
Graphs
Definition of a graph
Let’s give an example of an itemized list:
A graph G = (V, E) consists of a set V of vertices and a set E
of edges.
If G is a directed graph then E is a subset of the Cartesian
product V × V. An element e = (v, w) ∈ E represents an
edge from the vertex v to the vertex w.
If G is an undirected graph, then edges may be represented
in the form e = [v, w] where v, w ∈ V are vertices, and
where [v, w] = [w, v].
Example of a beamer presentation
Beamer warmup
Graphs
Labeled graphs
If G = (V, E) is a graph, a labeling of G is determined by a
function f : E → R; thus f assigns a real number to each
edge of the graph.
here is an example of a directed, labeled graph.
Example of a beamer presentation
Beamer warmup
Graphs
Labeled graphs
If G = (V, E) is a graph, a labeling of G is determined by a
function f : E → R; thus f assigns a real number to each
edge of the graph.
here is an example of a directed, labeled graph.
Example of a beamer presentation