0% found this document useful (0 votes)

55 views

Basic Definitions

The document defines basic graph theory terms including: - The degree of a vertex, which is the number of its neighbors - Regular graphs where every vertex has the same degree - The complement of a graph which connects vertices that are not connected in the original graph - Walks and paths, where walks allow repeated edges/vertices and paths do not

Uploaded by

Jan Marcel Manrique

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

0% found this document useful (0 votes)

55 views

Basic Definitions

Uploaded by

Jan Marcel Manrique

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/ 116

Basic Definitions

Alexander Golovnev
Outline

The Degree of a Vertex

Paths

Connectivity

Directed Graphs

Weighted Graphs
Definitions

An isolated vertex forms a component

Definitions

An isolated vertex forms a component

???
The Degree of a Vertex

The number of friends

The Degree of a Vertex

• The Degree of a vertex is the number of its

incident edges
The Degree of a Vertex

• The Degree of a vertex is the number of its

incident edges

• I.e., the Degree of a vertex is the number of

its neighbors
The Degree of a Vertex

• The Degree of a vertex is the number of its

incident edges

• I.e., the Degree of a vertex is the number of

its neighbors

• The degree of a vertex v is denoted by deg(v)

The Degree of a Vertex

• The Degree of a vertex is the number of its

incident edges

• I.e., the Degree of a vertex is the number of

its neighbors

• The degree of a vertex v is denoted by deg(v)

• The degree of a graph is the maximum degree

of its vertices
The Degree of a Vertex: Examples

The degree of v is 6: deg(v) = 6

The degree of v6 is 1: deg(v6 ) = 1

v6 v5

v1 v v4

v2 v3
The Degree of a Vertex: Examples

The degree of every vertex is 2: ∀i, deg(vi ) = 2

v4 v3

v5 v2

v1
Isolated Vertices

v8
v6 v5

v1 v0 v4

v2 v3
v7
Isolated Vertices
deg(v2 ) = 2

v8
v6 v5

v1 v0 v4

v2 v3
v7
Isolated Vertices
deg(v2 ) = 2
deg(v8 ) = 1

v8
v6 v5

v1 v0 v4

v2 v3
v7
Isolated Vertices
deg(v2 ) = 2
deg(v8 ) = 1
deg(v0 ) = 0. v0 is an Isolated Vertex
v8
v6 v5

v1 v0 v4

v2 v3
v7
Regular Graphs

A Regular graph is
a graph where each
vertex has the same
degree
Regular Graphs

A Regular graph is
a graph where each
vertex has the same
degree
A regular graph of
degree k is also
called k-Regular
Regular Graphs

A Regular graph is
a graph where each
vertex has the same
degree
A regular graph of
degree k is also
called k-Regular
E.g., this graph is 3-
Regular
Complement Graph

• The Complement of a graph G = (V, E) is a

graph G = (V, E) on the same set of vertices V
and the following set of edges:
Complement Graph

• The Complement of a graph G = (V, E) is a

graph G = (V, E) on the same set of vertices V
and the following set of edges:

• Two vertices are connected in G if and only if

they are not connected in G
Complement Graph

• The Complement of a graph G = (V, E) is a

graph G = (V, E) on the same set of vertices V
and the following set of edges:

• Two vertices are connected in G if and only if

they are not connected in G

• I.e., (u, v) ∈ E if and only if (u, v) ̸∈ E

Complement Graph

G G
v2 v1 v2 v1

v3 v6 v3 v6

v4 v5 v4 v5
Complement Graph

G G
v2 v1 v2 v1

v3 v6 v3 v6

v4 v5 v4 v5
Complement Graph

G G
v2 v1 v2 v1

v3 v6 v3 v6

v4 v5 v4 v5
Complement Graph

G G
v2 v1 v2 v1

v3 v6 v3 v6

v4 v5 v4 v5
Complement Graph

G G
v2 v1 v2 v1

v3 v6 v3 v6

v4 v5 v4 v5
Outline

The Degree of a Vertex

Paths

Connectivity

Directed Graphs

Weighted Graphs
Paths

Is there a path from one point to another?

Walks

• A Walk in a graph is a sequence of edges, such

that each edge (except for the first one) starts
with a vertex where the previous edge ended
Walks

• A Walk in a graph is a sequence of edges, such

that each edge (except for the first one) starts
with a vertex where the previous edge ended
• The Length of a walk is the number of edges
in it
Walks

• A Walk in a graph is a sequence of edges, such

that each edge (except for the first one) starts
with a vertex where the previous edge ended
• The Length of a walk is the number of edges
in it
• A Path is a walk where all edges are distinct
Walks