Spanning Tree | Rank and Nullity of a Graph | Branch and Chord of a Graph

Spanning Tree: A spanning tree is known as a subgraph of an undirected connected graph that possesses all of the graph's edges or vertices with the rarest feasible edges. If a vertex is missing, then it is not a spanning tree.
Branches: The set of edges in a spanning tree is called the branches of spanning tree.
Chords: The set of edges which is not present in the spanning sub graph of a super graph, is called the chords of the graph.
Rank: N-K, where N is the number of vertices and K is the no of components.
Rank is equals to the branches of the spanning tree of a main graph G.
Nullity: E-N+K, where E is the total no of edges, N is the number of vertices and K is the no of components. It is also equals to the chords.

Видео Spanning Tree | Rank and Nullity of a Graph | Branch and Chord of a Graph канала CSE Logix