Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
100 views

Graphs and Graph Models

This document defines and describes various graph models and terminology. It discusses what a graph is, including nodes and edges. It then describes types of graphs such as simple graphs, multi-graphs, directed and undirected graphs, connected and disconnected graphs, weighted graphs, and bipartite graphs. It also defines graph terminology like degree, path, cycle, and connectivity. Finally, it discusses special types of graphs including complete graphs, trees, directed acyclic graphs, and weighted directed acyclic graphs.

Uploaded by

Mari Maramag
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
100 views

Graphs and Graph Models

This document defines and describes various graph models and terminology. It discusses what a graph is, including nodes and edges. It then describes types of graphs such as simple graphs, multi-graphs, directed and undirected graphs, connected and disconnected graphs, weighted graphs, and bipartite graphs. It also defines graph terminology like degree, path, cycle, and connectivity. Finally, it discusses special types of graphs including complete graphs, trees, directed acyclic graphs, and weighted directed acyclic graphs.

Uploaded by

Mari Maramag
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

GRAPHS AND GRAPH

MODELS, GRAPH
TERMINOLOGY AND
SPECIAL TYPES OF
GRAPHS
WHAT IS A GRAPH?
• A graph is a mathematical representation of a set of objects, called vertices or nodes,
connected by links or edges. It is a widely used data structure to represent
relationships between entities. Graphs consist of two main components: vertices/nodes
and edges/links.
• Definition – A graph (denoted as G=(V,E)
consists of a non-empty set of vertices or nodes V and a set of edges E.
EXAMPLE:

• Let us consider, a Graph is G=(V,E) where V={a,b,c,d} and E={{a,b},{a,c},{b,c},{c,d}}

• Degree of a Vertex − The degree of a vertex V of a graph G (denoted by deg (V)) is the number of
edges incident with the vertex V.
Even and Odd Vertex – If the degree of a vertex is even, the
vertex is called an even vertex and if the degree of a vertex is
odd, the vertex is called an odd vertex.
 
Degree of a Graph – The degree of a graph is the largest vertex
degree of that graph. For the above graph the degree of the
graph is 3.
 
The Handshaking Lemma – In a graph, the sum of all the
degrees of all the vertices is equal to twice the number of
edges.
TYPES OF GRAPHS:
• Null Graph
-A null graph has no edges. The null graph of n
Vertices is denoted by Nn
• Simple Graph
- A graph is called simple graph/strict graph if the graph is undirected and does not
contain any loops or multiple edges.

• Multi-Graph
-If in a graph multiple edges between the same set of vertices are allowed, it is called
Multigraph. In other words, it is a graph having at least one loop or multiple edges.
DIRECTED AND UNDIRECTED GRAPH

A graph G=(V,E)
is called a directed graph if the edge set is made of ordered vertex pair and a graph is
called undirected if the edge set is made of unordered vertex pair.
CONNECTED AND DISCONNECTED GRAPH

A graph is connected if any two vertices of the graph are connected by a path; while a graph is disconnected if at least
two vertices of the graph are not connected by a path. If a graph G is disconnected, then every maximal connected
subgraph of G
is called a connected component of the graph G
WEIGHTED GRAPH

• In a weighted graph, each edge is assigned a numerical value called a weight or cost.
The weight represents a certain property or metric associated with the relationship
between two nodes, such as distance, cost, or capacity.
BIPARTITE GRAPH

If the vertex-set of a graph G can be split into two disjoint sets, V1 and V2, in such a way that each
edge in the graph joins a vertex in V1to a vertex in V2, and there are no edges in G that connect two
vertices in V1 or two vertices in V2, then the graph G is called a bipartite graph.
GRAPH TERMINOLOGY

• Degree
-The degree of a vertex is the number of edges connected to it. In a directed graph, the
degree is further divided into in-degree (number of incoming edges) and out-degree
(number of outgoing edges).
• Path
-A path is a sequence of vertices connected by edges. It represents a sequence of
relationships between entities.
• Cycle
- A cycle is a path that starts and ends at the same vertex, without visiting any other
vertex more than once. It forms a closed loop.
• Connected Graph:
- A connected graph is a graph in which there is a path between every pair of vertices.
There are no isolated vertices.
• Strongly Connected Graph
- In a directed graph, a graph is strongly connected if there is a directed path between
every pair of vertices.
SPECIAL TYPES OF GRAPHS
• Complete Graph

- A complete graph is a simple undirected graph in which there is an edge between every pair of distinct vertices. It is denoted by
the symbol (Kn), where n represents the number of vertices.

• Tree

-A tree is an undirected graph without cycles. It is a connected acyclic graph. In a tree, there is exactly one path between any pair
of vertices.

• Directed Acyclic Graph (DAG)

- A directed acyclic graph is a directed graph that does not contain any cycles. It is often used to represent dependencies and
directed relationships in various applications, such as task scheduling or computational workflows.

• Weighted Directed Acyclic Graph

- A weighted directed acyclic graph is a DAG in which each edge has a weight assigned to it. It is commonly used in optimization
problems, such as finding the shortest path or the longest path in a graph.

You might also like