Paper-3 ||Semester-1|| Assignment problem with modified matrix ||how do assign zeroes||Ritesh sir
Similar Tracks
Lec-25|Theorem 5.15.4|G is connected graph then G is bipartite iff G has no odd cycle|Ritesh sir
RITE INSTITUTE
Lec-24 ||Subgroup||One step test for subgroup |Net| IITJam|| importantquestion grouptheory|Riteshsir
RITE INSTITUTE
Simplex method ||Linear programming problem||LPP||Concept to solve lpp by simplex method||Ritesh sir
RITE INSTITUTE
Lec-26|G is simple graph with k connected components.Then no.of edges can’t exceed (n-k)(n-k+1)/2
RITE INSTITUTE
Lec-27|A connected graph G has an euler trail iff it has at most 2 vertices of odd degree|Riteshsir
RITE INSTITUTE