Max Flow – Min Cut Theory

Hello Readers Hope you are doing well. Today i am here with detailed discussion on Max Flow - Min Cut problems and solutions. For application part you can refer my previous post Network Flows: Max Flow + MinCut Theory. Consider the following situation why Max flow is required. From the above image it is clear … Continue reading Max Flow – Min Cut Theory

Network Flows: Max Flow + MinCut Theory

Hello Readers Happy New Year 2018 Hope you are doing well. Today I am going to post a very very important topic of Graph theory that is Network Flows. Let us think two questions "What and Why" about Network Flows. Readers, just imagine you are a courier service provider and you have to deliver some … Continue reading Network Flows: Max Flow + MinCut Theory

Cayley’s Theorem: Enumeration of Graphs

Hello Readers, Hope you all are doing well. Today, I am going to write the proof of Cayley's Theorem which counts the number of labelled trees. Cayley's Theorem is very important topic in graph theory. If you study Graph theory and don't know Cayley's theorem then it would be very surprising. Ok, So lets start … Continue reading Cayley’s Theorem: Enumeration of Graphs