Hi everyone, I was going through the concept of graphs as matroids and I came upon the rank of a graph. Wikipedia lists it as n - c, n = |V|, c = # of connected components.
I do understand rank and nullity of matrices, and graphs when expressed in their incidence matrix form have a one-to-one correspondence with the rank of its incidence matrix. However, I am not understanding how r(G) = |V| - c, c = # of connected components and the definition of rank as the maximum size of a subforest of G are equivalent. I tried looking it up on Google and StackOverFlow but found no satisfactory explanation. Any resources that would be helpful to understand the concept would be great. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/869b3f91-b431-43a4-b273-e51cc10ff6ean%40googlegroups.com.
