S.T there is only one path between every pair of vertices in a tree. -Graph Theor

@btech maths hub 7050 Conjunctive Normal Form Mathematical Logics- MFCS - DMS. Most Imp problems

@btech maths hub 7050 Equivalence Formulas#DMS#DMGT#MFCS Mathematical Logics

@btechmathshub7050 To find poles and corresponding Residues of the function-complex Analysis

@btechmathshub7050 Z-Transforms-Final Value Theorem-Proof

@btechmathshub7050 Z-Transforms-Initial Value Theorem -Proof

@btech btech maths hub Z-Transforms Shifting property- solve z(2.3^n+5n)

@btechmathshub7050 Z-Transforms-Shifting Properties-Most Imp Problems

@btechmathshub7050 Z-Transforms definition Problems related to definition

@btech maths hub 7050 Z- transforms Damping Rule- Z(cosht.sinbt) solution

@btechmathshub7050Using Z-Transforms find Z(cosnt) Z(sinnt) Z(cosnpi/2) Z(Sinnpi/2) Z(a^ncosnt)

@btechmathshub7050 Z- Transforms- Using Z -Transforms find Z(n²) Z(n³) Z(n⁴).

@btechmathshub7050 Prim's Algorithm/5 Most important Problems-Graph Thoery- Min Spanning Trees.

February 10, 2023

February 8, 2023

@btechmathshub7050 Kruskal's Algorithm-With most important problems-Graph Theory

@btechmathshub7050Breadth First Search - Algorithm & Most important problem

@btechmathshub7050 Graph Traversal/Breadth first search-Depth first search- Introduction

@btechmathshub7050Spanning Tree/Minimum spanning tree-Graph Theory

@btechmathshub7050S.T there is only one path between every pair of vertices in a tree. -Graph Theor

@btechmathshub7050 Prove that a tree with n-Vertices has (n-1) edges-Graph Theory

@btechmathshub7050 Path length of a tree-Graph theory

@btechmathshub7050 Binary tree/Types of binary tree-Graph Theory

@btech maths hub Trees/Rooted Trees/Isolated vertices/Leaves/child/parent/Sibling/Cousins with examp

@btechmathshub7050Edge covering with examples-Graph Theory