Scribd
Upload
23 views4 pages

Graph

The document defines key terms in graph theory including graphs, complete graphs, equivalent graphs, Euler circuits, Eulerian graphs, and Hamiltonian circuits. It then provides examples of applications for Euler paths and weighted graphs. Specifically, it shows how an Euler path can be used to traverse every edge of a graph with no repeats and gives an example. It also explains that weighted graphs are graphs where each edge has a numerical weight and can be used to model real-world networks where the weights represent distances or capacities. Examples of using weighted graphs to model road networks and resource transportation are given.

Uploaded by

Faith Michelle Dinopol
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
23 views4 pages

Graph

The document defines key terms in graph theory including graphs, complete graphs, equivalent graphs, Euler circuits, Eulerian graphs, and Hamiltonian circuits. It then provides examples of applications for Euler paths and weighted graphs. Specifically, it shows how an Euler path can be used to traverse every edge of a graph with no repeats and gives an example. It also explains that weighted graphs are graphs where each edge has a numerical weight and can be used to model real-world networks where the weights represent distances or capacities. Examples of using weighted graphs to model road networks and resource transportation are given.

Uploaded by

Faith Michelle Dinopol
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/ 4

Dinopol, Faith Michelle A.

BSA – 1 MWF (12:00 pm – 1:30 pm)

A. Define the following:

1. Graph Theory
Graph theory is the study of mathematical objects known as graphs,
which consist of vertices(or nodes) connected by edges. (In the figure below,
the vertices are the numbered circles, and the edges join the vertices.)

2. Complete Graph
A complete graph is a simple undirected graph in which every pair of
distinct vertices is connected by a unique edge. A complete digraph is
a directed graph in which every pair of distinct vertices is connected by a pair
of unique edges (one in each direction).

3. Equivalent Graph
A Equivalent Graph has two graphs are equal if they have the same
vertex set and the same set of edges. Two graphs are equivalent if their
vertices can be relabeled to make them equal.

4. Euler Circuits
An Euler circuit is an Euler path which starts and stops at the same
vertex. An Euler circuit is a circuit that uses every edge in a graph with no
repeats. Being a circuit, it must start and end at the same vertex. Eulerian
Graph Theorem

5. Eulerian Graph Theorem


A graph is considered Eulerian if the graph is both connected and has
a closed trail (a walk with no repeated edges) containing all edges of the graph.
Definition: An Eulerian Trail is a closed walk with no repeated edges but
contains all edges of a graph and return to the start vertex.

6. Hamiltonian Circuits
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton
cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through
a graph that visits each node exactly once (Skiena 1990, p. 196). A graph
possessing a Hamiltonian cycle is said to be a Hamiltonian graph. By
convention, the singleton graph is considered to be Hamiltonian even though
it does not posses a Hamiltonian cycle, while the connected graph on two
nodes is not.

B. Find at least one application of the following:

1. Euler path

An Euler path is a path that uses every edge in a graph with no


repeats. Being a path, it does not have to return to the starting vertex.

In the graph shown below, there are several Euler paths. One such
path is CABDCB. path is shown in arrows to the right, with the order of
edges numbered.
2. Weighted graph

A weighted graph is a graph where each edge has a numerical


value called weight. Given below is an example of a weighted graph:

The graph consists of five nodes and seven edges. Each edge has some weight.
For example, the edge \{0, 3\}{0,3} has weight 77, the edge \{1, 2\}{1,2} has weight 11.

Weighted graphs are often used to model real objects and processes. For
example, the graph above can be considered as a map, where the nodes are cities
and the edges are roads. The weight of each edge is the distance between two cities.

The graph above is an undirected graph. But weighted graphs can also be
directed. Given below is an example of a directed weighted graph:
Weighted directed graphs are also can be used to model some real processes.
For instance, the node 00 in the graph above can be considered as a storage, from
where we need to transfer some resources to the destination point, say to the node 22.
The remaining nodes can be considered as intermediate places. Each edge shows a
direction in which the resources can be transferred. The weight of an edge shows the
maximum amount of resources that can be sent through the edge.

Note that for the graphs above all the weights are positive. But negatives (and
zero) weights are also allowed.

You might also like