Poster on Graph Terminologies

1. G. H. RAISONI COLLEGE OF ENGINEERING
(An Autonomous Institute affiliated by R. T. M. Nagpur University under UGC Act 1956)
Department of Information Technology
SESSION 2016-2017
NAME: DEEPAK R TATHE
ROLL NO: 37
TOPIC: GRAPH TERMINOLOGIES
SUB: DATA STRUCTURE
What is a Graph?
A graphG=(V,E) is composedof
V : Set of vertices
E: Set of edges connectingthe vertices V
V={2,3,4,5,6,7}
E={
(2,4),(4,5),(5,7),(
3,7)}
EDGE
VERTICES
Edges, also called as arcs, are represented by (u,v)
and are either directed or undirected.
Kinds of Graph: Directed and Undirected
GRAPH TERMINOLOGIES
Adjacent nodes: Two nodes are adjacent if they are
connected by an edge
Path: A sequence of vertices that connect two
nodes
In a graph
A simple path is a path in which all vertices,except
Possibly in the first and last, are different.
Complete graph: A graph in which every vertex is
directly connected to every other vertex.
5 7
Connected Graph: Any two vertices are connected by
some path.
Connected Not connected
Subgraph: Subset of vertices and edges forming a
graph