Graph theory

 Algorithm & data structure

 Expert in anyone programming language
 Computer architecture, DBMS
 You have to smart in engineering
 Know about companies
What services these are providing
 What is mean by
GRAPH: Order could be zero but size is not
Types of edges:
1. Single edges:
2. Multiple edges or parallel edges:
3. Self-loop
Degree of any vertex: no of edges that is present or incident on a vertex. Denotes as d(v), degree of any self-loop is 2, if d(v)=0 is
called as isolated vertex.
d(v)=1: is pendant vertex
if degree of any vertex is odd is called odd vertex and applies for even also.

Size of graph:
Order of a graph:

Types of graphs
 Simple Graphs: which have no parallel edges, no self-loop.
Q1. What could be minimum size of simple graph.? For N vertices is also answer is zero.
 Regular Graph: When degree of all vertices is same
 Complete Graph: no self-loop, no parallel edges, max size
k n= complete graph of order n
Maximum size of a complete graph is