Scribd
Upload
84 views9 pages

Def Slide

This document defines key graph theory terms including subgraph, spanning subgraph, walk, trail, path, closed trail/circuit, cycle, length, distance, connected graph, and component. A subgraph contains a subset of the vertices and edges of the original graph. A spanning subgraph contains all the same vertices as the original graph. A walk allows repeated edges or vertices, a trail allows repeated vertices but not edges, and a path allows neither repeated edges nor vertices. The length of a walk/trail/path/cycle is the number of edges it contains. A graph is connected if there is a path between every pair of vertices.

Uploaded by

Jeevadoss
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
84 views9 pages

Def Slide

This document defines key graph theory terms including subgraph, spanning subgraph, walk, trail, path, closed trail/circuit, cycle, length, distance, connected graph, and component. A subgraph contains a subset of the vertices and edges of the original graph. A spanning subgraph contains all the same vertices as the original graph. A walk allows repeated edges or vertices, a trail allows repeated vertices but not edges, and a path allows neither repeated edges nor vertices. The length of a walk/trail/path/cycle is the number of edges it contains. A graph is connected if there is a path between every pair of vertices.

Uploaded by

Jeevadoss
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/ 9

Definitions

Definition (Subgraph)
Let G be a graph with vertex-set V (G ) and edge-set E (G ).
Let H be a graph with vertex-set V (H) and edge-set E (H).
Then we say that H is a subgraph of G if V (H) ⊆ V (G ) and
E (H) ⊆ E (G ).

Example

1 / 10
Definitions

Definition (Spanning Subgraph)


A spanning subgraph of G is a subgraph H with V (G ) = V (H),
i.e., G and H have exactly the same vertex-set.

Example

2 / 10
Definitions

Definition (Walk)
A walk in a graph G is an alternating sequence of vertices and
edges W = hv0 , e1 , v1 , e2 , · · ·, vn−1 , en , vn i .

Beginning and ending with vertices in which


endpoints(ei ) = {vi−1 , vi }, for i = 1, 2, . . . , n
v0 is the origin and vn is the terminus vertices.

Definition (Trail)
A trail is a walk with no repeated edge (vertices may be repeated).

Definition (Path)
A path is a walk with no repeated vertex (edges cannot be
repeated).

3 / 10
Definitions
Definition (closed trail / circuit)
A closed trail / circuit is a trail that begins and ends at the same
vertex.
Definition (cycle)
A closed path / cycle is a path that begins and ends at the same
vertex.
Example

4 / 10
Definitions

Example

5 / 10
Definitions

Example

6 / 10
Definitions

Definition (length)
The length of a walk (or trail, path, cycle) is the number of edges
in the walk (or trail, path, cycle) sequence.
Note
A path of length k is called a k-path.
A cycle of length k is called a k-cycle.
k- cycle is odd or even according as k is odd or even.
A 3-cycle is often called a triangle.

7 / 10
Definitions

Definition (distance)
The distance d (u, v ) from a vertex u to a vertex v in a graph G is
the length of a shortest (u, v )-path if one exists; otherwise
d (u, v ) = ∞.

Example

8 / 10
Definitions
Definition (connected graph)
A graph is connected if for every pair of vertices u and v , there is a
path from u to v . A graph that is not connected is called
disconnected.
Note
It is easy to see that a disconnected graph consists of two or
more connected graphs. Each of these connected subgraphs is
called a component.
The number of components of G is denoted C (G ).

Example

9 / 10

You might also like