A connected graph has `b' number of branches and `n' number

Home » Network Theory » Network Elements and the Concept of Circuit » Question

A connected graph has `b' number of branches and `n' number of nodes. Its ranks is—

1. b
2. n
3. b – 1
4. n – 1

Correct Option: D

The rank of graph having node n = n – 1.