Introduction to Graph Theor

Graph theory is a branch of mathematics that explores the properties

and applications of graphs. These graphs are mathematical structures
used to model pairwise relations between objects. Its origins trace
back to Leonhard Euler's 1736 solution to the Königsberg bridge
problem, marking the inception of this field.

Today, graph theory is applied across diverse fields such as computer

science, where it is used in algorithm design and network analysis;
social networks, for understanding relationships and influence;
logistics, to optimize routes and delivery systems; and even
chemistry, for modeling molecular structures. Graph theory continues
to evolve, driven by the need to solve complex problems in an
interconnected world.
by Conrad Roy Jr Espanto Cruz
Basic Definitions in Graph Theory
Key Components Graph Types

A graph G is defined as G = (V, E), where V is the set of Graphs can be categorized into directed, where edges
vertices, and E is the set of edges connecting these have a specific direction; undirected, where edges have
vertices. A vertex, also known as a node, is a fundamental no direction; and weighted, where edges have associated
unit within the graph. An edge represents a connection or costs or values. For example, a social network can be
relationship between two vertices. modeled as a graph where vertices represent people, and
edges represent friendships or connections between
them.

Understanding these basic definitions is crucial for delving into more advanced topics in graph theory. The properties and
behavior of graphs are essential for solving real-world problems in diverse domains.
Types of Graphs
Simple Graph Multigraph
A simple graph contains no loops (edges connecting A multigraph allows multiple edges between
a vertex to itself) and no multiple edges between vertices, indicating multiple relationships or
any two vertices. connections.

Pseudograph Complete & Bipartite Graphs

A pseudograph permits both loops and multiple A complete graph (Kn) connects every pair of
edges, providing maximum flexibility in modeling vertices, while a bipartite graph divides vertices into
relationships. two disjoint sets with edges only between the sets.

These graph types serve different modeling purposes. For instance, a complete graph K5, which has 5 vertices, contains
10 edges, connecting every pair of vertices. Bipartite graphs are useful in scenarios where relationships are strictly
between two distinct groups.
Graph Representation
Adjacency Matrix
Represents connections between vertices. A '1' indicates
adjacency, while '0' indicates no connection. Useful for dense
graphs.
Incidence Matrix
Represents the relationship between vertices and edges, useful
for analyzing network flow and connectivity.

Adjacency List
Lists adjacent vertices for each vertex, more space-efficient for
sparse graphs. Enables quick neighbor lookups.

The choice of representation depends on the specific application and the

density of the graph. Adjacency matrices are straightforward but can be
memory-intensive for large, sparse graphs. Adjacency lists are more efficient
for sparse graphs, as they only store existing connections.
Connectivity in Graph Theory
Cycle Connected Graph
A cycle is a path that starts and A connected graph means there is a
ends at the same vertex, forming a path between any two vertices,
closed loop. ensuring all nodes are reachable. Connected Components
Path
Maximal connected subgraphs
A path is a sequence of vertices within a larger graph are connected
connected by edges, illustrating a components, representing isolated
route through the graph. networks.

2 3

1 4

In directed graphs, strong connectivity requires a path in both directions between any two vertices. Analyzing connectivity is crucial in network analysis,
helping to identify bottlenecks and critical nodes. For example, identifying connected components in a network graph can reveal isolated clusters of users.
Graph Traversal Algorithms
1 Breadth-First Search (BFS)
BFS explores all the neighbors of a node before moving to the
next level, using a queue to maintain the order of exploration.

2 Depth-First Search (DFS)

DFS explores as far as possible along each branch before
backtracking, using a stack to keep track of visited nodes.

These traversal methods have varied applications: BFS is optimal for

finding the shortest path in unweighted graphs, while DFS is suitable for
detecting cycles and exploring paths in complex networks. They are
fundamental in network scanning, pathfinding, and solving mazes. The
choice between BFS and DFS depends on the specific problem
requirements.
Eulerian and Hamiltonian Paths
Euler Path and Cycle
An Euler path visits every edge exactly once, while an Euler cycle is an
Euler path that starts and ends at the same vertex. Euler's theorem
provides conditions for their existence.

Hamiltonian Path and Cycle

A Hamiltonian path visits every vertex exactly once, while a Hamiltonian
cycle is a Hamiltonian path that starts and ends at the same vertex.
Dirac's theorem provides conditions for their existence.

These paths and cycles are used in diverse applications such as route
planning and puzzle-solving. For instance, finding a Hamiltonian cycle in a
chessboard graph involves visiting every square exactly once and returning to
the starting square. These concepts are essential in algorithmic graph theory.
Planar Graphs and Graph Coloring
Planar Graphs Graph Coloring

A planar graph can be drawn on a plane without any Graph coloring involves assigning colors to vertices such
edges crossing, allowing for simplified visualization and that adjacent vertices have different colors, minimizing
analysis. color usage.

The chromatic number is the minimum number of colors required to color a graph. The Four Color Theorem states that
any planar graph can be colored with four colors. These concepts are applied in map coloring and scheduling problems,
where resources must be allocated without conflicts. For example, coloring a map of US states ensures no adjacent
states share the same color.
Applications of Graph Theory

Social Network Logistics and Computer Science

Analysis Transportation
Graph theory aids in
Graph theory helps identify It optimizes routes and algorithm design and the
influencers and detect manages network flow, creation of efficient data
communities within social improving efficiency and structures.
networks. reducing costs.

Chemistry
It provides tools for
representing and analyzing
molecular structures and
interactions.

Graph theory is an indispensable tool for solving real-world problems. For instance, UPS uses
graph theory to optimize delivery routes, saving approximately $300 million annually. These
applications demonstrate the practical impact and versatility of graph theory across various
domains.
Conclusion: The Power
of Graph Theory
Graph theory is a powerful tool for modeling relationships and solving
complex problems across diverse fields. Its versatility makes it
invaluable in computer science, social network analysis, logistics, and
chemistry. The continued research and development of new
algorithms and theories promise even more innovative applications in
the future.
As our world becomes increasingly interconnected, the ability to
model and analyze relationships will become even more critical.
Graph theory provides a robust framework for understanding and
optimizing these connections, driving efficiency and innovation. By
harnessing its potential, we can unlock new insights and solutions to
complex challenges.