Scribd
Upload
100 views8 pages

Graph Theory

The document defines various types of graphs including directed graphs, undirected graphs, mixed graphs, simple graphs, multigraphs, null graphs, and complete digraphs. It also defines graph-related concepts such as subgraphs, parallel edges, degrees of nodes, isomorphic graphs, and provides an example of two isomorphic digraphs.

Uploaded by

Vedant Ingale
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
100 views8 pages

Graph Theory

The document defines various types of graphs including directed graphs, undirected graphs, mixed graphs, simple graphs, multigraphs, null graphs, and complete digraphs. It also defines graph-related concepts such as subgraphs, parallel edges, degrees of nodes, isomorphic graphs, and provides an example of two isomorphic digraphs.

Uploaded by

Vedant Ingale
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/ 8

Definitions

Graph : Let V be the non-empty set of nodes


(vertices or points) of the graph, E be the set of
edges of the graph and  is a mapping from the
set of edges to a set of ordered or unordered pair
of nodes in V, then G  V , E ,  is said to be a graph.

n(V) is size of the graph


n(E) is order of the graph

Subgraph: Let V' be a subset of V and E' be a


subset of E whose end vertices belong to V' then
H V ' , E ' is called a subgraph of the graph G  V , E
Directed Graph : A graph in which every edge is
directed is called a directed graph or a digraph.

Undirected Graph : A graph in which every edge


is undirected is called a undirected graph.

Mixed Graph : If some edges are directed and


some are undirected then the graph is mixed
graph.
Simple Graph: Any graph which donot involve
parallel edges is called a simple graph.

Multigraph : Any graph which involves some


parallel edges is called a multigraph.

* In some directed or undirected graph, certain


pairs of nodes are joined by more than one
edge.
Such edges are called parallel edges.
Null Graph : A graph containing only isolated
nodes is called a null graph.

* In a graph a node which is not adjacent to any


other node is called an isolated node.

Complete digraph : A simple digraph is said to be


complete if every node is adjacent to all other
nodes of the graph.
Indegree of a node: It is the total number of
edges ending up(coming in) at a node.

Outdegree of a node: It is the total number of


edges beginning from(going away) from a node.

Total degree of a node : It is the sum of


indegree and outdegree of a node.

* Sum of all indegrees of all nodes(or all


outdegrees of all nodes) gives the total number
of edges in a graph.
Isomorphic Graphs :

Two graphs are isomorphic if there


exists a one-to-one correspondance between
the nodes of the two graphs which preserves
the adjacency of the nodes as well as the
directions of the edges, if any.
Show that the digraphs are isomorphic
4
u3 u4

2 3
2

u2 u1
1

Nodes indegree outdegree Nodes indegree outdegree


1 0 2 u1 1 1
2 1 1 u2 2 0
3 1 1 u3 0 2
4 2 0 u4 1 1
Total 4 4
Total 4 4
: graph (a) graph (b)

1 u3 2 u1

3 u4 4 u2

(1, 2) , (1, 3), (3, 4), (2, 4)

(u3 , u1) , (u3, u4), (u4, u2), (u1, u2)

You might also like