Scribd
Upload
2 views

Graph Theory

Graph theory is a mathematical field focused on studying graphs, which consist of vertices and edges representing relationships between objects. Key concepts include vertices, edges, paths, cycles, and types of graphs such as simple, multigraph, undirected, directed, weighted, and complete graphs. Each type of graph has specific characteristics that define how vertices are connected and the nature of those connections.

Uploaded by

iothorana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
2 views

Graph Theory

Graph theory is a mathematical field focused on studying graphs, which consist of vertices and edges representing relationships between objects. Key concepts include vertices, edges, paths, cycles, and types of graphs such as simple, multigraph, undirected, directed, weighted, and complete graphs. Each type of graph has specific characteristics that define how vertices are connected and the nature of those connections.

Uploaded by

iothorana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 10

Graph Theory

What is Graph Theory?


• Graph theory is a branch of mathematics that studies graphs, which
are mathematical structures used to model pairwise relationships
between objects
• A graph consists of vertices (or nodes) and edges (or links) that
connect pairs of vertices.
Key concepts in graph theory
• Vertices (Nodes): The individual entities in a graph
• Edges (links): The connections between the vertices
Key concepts in graph theory
• Graph - A graph is a collection of vertices and edges
• Adjacent Vertices: Vertices connected by an edge.
• Degree of a Vertex: The number of edges connected to a vertex.
• Path: A path in a graph is a sequence of vertices where each adjacent
pair is connected by an edge.
• Cycle: A cycle is a path that starts and ends at the same vertex, with
no other repetitions of vertices or edges.
• Connected Graphs: A graph is connected if there is a path between
every pair of vertices. In other words, every vertex in a connected
graph can reach every other vertex through some sequence of edges
Types of Graphs
• Simple Graph
A simple graph is a type of graph where there are no loops
(edges that connect a vertex to itself) and no multiple edges between
any pair of vertices. In other words, each pair of vertices is connected
by at most one edge, and each edge connects two distinct vertices.
Types of Graphs
• Multigraph
A multigraph is a type of graph in which multiple edges are
allowed between the same pair of vertices.
Types of Graphs
• Undirected Graph: A graph where edges have no direction, meaning
connections are bidirectional.
Types of Graphs
• Directed Graphs (Digraphs)
A directed graph, or digraph, has edges with a specific direction,
meaning that each edge goes from one vertex to another distinct
vertex. The direction is often represented by an arrow, indicating the
flow or one-way relationship.
Types of Graphs
• Weighted Graph
A weighted graph is a type of graph where each edge is assigned a
weight, usually representing some form of cost, distance, or value.
These weights can be used to represent a variety of metrics, such as
travel time, distance between locations, or bandwidth in a network.
Types of Graphs
• Complete Graph
A complete graph is a type of graph in which every pair of distinct
vertices is connected by a unique edge

You might also like