Scribd
Upload
9 views3 pages

Types of Graph

Uploaded by

AARTHI IT
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
9 views3 pages

Types of Graph

Uploaded by

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

Types of Graph

1.Complete Graph:

The 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).

The complete graph on n vertices is denoted by Kn.


Kn has n(n−1)/2 edges and is a regular graph of degree n−1.

2.Connected or Disconnected Graph:

A connected graph is a graph in which it's possible to get from every vertex in the
graph to every other vertex through a series of edges, called a path.An undirected
graph that is not connected is called disconnected

Vertex 1 Vertex 2 PATH

a b ab
Vertex 1 Vertex 2 PATH

a c a b c, a c

a d a b c d, a c d

b c bac,bc

c d cd

3.Disconnected Graph

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.

Vertex 1 Vertex 2 PATH

a b ab

a c Not Available

a d Not Available

b c Not Available

c d cd

4. Strongly Connected
A graph is said to be strongly connected if every pair of vertices(u, v) in the
graph contains a path between each other. In an unweighted directed graph G,
every pair of vertices u and v should have a path in each direction between them
i.e., bidirectional path. The elements of the path matrix of such a graph will contain
all 1’s.

5. Unilaterally Connected
A graph is said to be unilaterally connected if it contains a directed path
from u to v OR a directed path from v to u for every pair of vertices u, v. Hence, at
least for any pair of vertices, one vertex should be reachable form the other. Such a
path matrix would rather have upper triangle elements containing 1’s OR lower
triangle elements containing 1’s.

6. Weakly Connected
A directed graph is weakly connected if there is a path between every two
vertices in the underlying undirected graph (i.e, the graph formed when the
direction of the edges are removed).

You might also like