In this video i discussed about Strongly connected and weakly connected graphs in graph theory in discrete mathematics
For more videos subscribe my channel
youtube=ww.youtube.com/channel/UCc8W653pKXtKkzI6lRGweemw
bipartite graph, complete bipartite graph, sub graph and handshaking theorem in graph theory=[ Ссылка ]
Strongly and weakly connected graph =[ Ссылка ]
Complete graph,multi graph,connected and disconnected graph=[ Ссылка ]
null graph ,trivial graph,simple graph,regular graph=[ Ссылка ]
Degree of a node in directed and undirected graphs =[ Ссылка ]
undirected ,directed and mixed graphs=[ Ссылка ]
GRAPH THEORY INTRODUCTION=[ Ссылка ]
Adjacency list,simple path,circuit,connected components=[ Ссылка ]
cut vertex,cut edge,problem on number of paths of length n=[ Ссылка ]
euler's path in undirected graph =[ Ссылка ]
