A new notion of vertex independence and rank for finite graphs

Details A new notion of vertex independence and rank for finite graphs A new notion of vertex independence and rank for finite graphs

2012-01-19

arxiv.org/abs/1201.3984v2

Mathematics

Combinatorics

47 pages

Scientific paper

A new notion of vertex independence and rank for a finite graph G is introduced. The independence of vertices is based on the boolean independence of columns of a natural boolean matrix associated to G. Rank is the cardinality of the largest set of independent columns. Some basic properties and some more advanced theorems are proved. Geometric properties of the graph are related to its rank and independent sets.

Affiliated with

Also associated with

No associations

Rating

A new notion of vertex independence and rank for finite graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A new notion of vertex independence and rank for finite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A new notion of vertex independence and rank for finite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-253705