1

/

2

Part-1| Introduction to Graph Theory in Discrete Mathematics in hindi basics concepts fundamentals

Part-2| Adjacent Edges Adjacent Vertex Self loop Parallel Edge Multi Graph Pseudo Graph Simple Graph

Part-3 | Finite Graph Null Graph Trivial Graph Complete Graph| Graph Theory | gate | net

Part-4 | handshaking theorem in graph theory in hindi or sum of degrees of vertices theorem in hindi

Part-5 | Practice problem on Hand Shaking Theorem or Sum of Degree Theorem handshaking lemma graph

Part-6 | Minimum Degree of a Graph in Graph Theory in hindi simple graph degree of a vertex in graph

Part-7 | Maximum Degree of a Graph in Graph Theory in hindi simple graph degree of a vertex in graph

Part-8 | degree sequence of a graph in hindi example theorem algorithm valid graph theory

Part-9 | havel hakimi theorem graph theory in hindi example algorithm graph theory proof statement

Number of simple Graph possible with n vertices | Graph Theory | gate - part 10

Number of simple Graph possible with n vertices and e edges | Graph Theory | gate - part 11

Regular Graph and Cycle graph | Graph Theory | gate - part 12

Part-13 bipartite graph in discrete mathematics in hindi example definition complete graph theory

Part-14 walk and path in graph theory in hindi trail example open closed definition difference

Part-15 | euler graph in hindi euler graph example proof graph theory history euler circuit path

1

/

2