Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Hi , i'm a bit new in Graph theory and i saw this definition of "Rank" on Wikipedia

http://en.wikipedia.org/wiki/Rank_(graph_theory)

and i noticed that it states that the rank of an Undirected Graph is n - c

so i wondered is there a rank for Digraphs?

thanks in advance

share|improve this question

migrated from mathoverflow.net Jun 26 '13 at 16:47

This question came from our site for professional mathematicians.

1 Answer 1

The rank of an undirected graph is the rank of the incidence matrix of any orientation of it. The simplest way to define the rank of a digraph is as the rank of the graph which it is an orientation of.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.