TopBottom

Followers



Click on more
SUBSCRIBE

Enter your email address:

Delivered by FeedBurner



VIDEO

Announcement: wanna exchange links? contact me at ravikrak@yahoo.com

Graphs

Posted by Ravi Kumar at Saturday, March 7, 2009
Share this post:
Ma.gnolia DiggIt! Del.icio.us Yahoo Furl Technorati Reddit

INTRODUCTION:
Graphs are mathematically structures and are found very
useful in problem solving.
Graphs provide an excellent way to describe the essential
features of many applications.
Graph is a set of nodes (or vertices ) and edges (or arcs)
which connect them.

G= (V,E)

where V is the set of nodes and E is the set of edges.
A set of edges E are such that E={(vi,vj)} where vi,vj ?V.
That is each edge in a graph is specified by a pair of
nodes.

Types Of Graphs:

DIRECTEDGRAPH:-
There is an edge from one node to another node then that is called Directed
graph.

UNDIRECTEDGRAPH:-There is no edge between from one to any other
node then that is called Undirected graph.

ISOLATEDGRAPH:-There is no path from one node to another node
then that is called isolated graph.

NULLGRAPH:-A graph which contains the only isolated nodes then
that graph is said to be the Null graph.

MIXEDGRAPH:-A graph which contains the both directed and
undirected graph then that is said to be the Mixed graph.

CYCLICGRAPH:-In directed graph which starts from source node to
destination node.
the source and destination nodes are the same.There is
a loop can be formed.that is the Cyclicgraph.

MULTIGRAPH:-Which graph have some parallel edges then that graph
is said to be Multi graph.

SIMPLEGRAPH:-A graph which have no parallel edges then that graph
is said to be Simple graph.

Share |

0 comments:

Post a Comment