A new notion of vertex independence and rank for finite graphs

作者：Rhodes John^*; Silva Pedro V

来源：International Journal of Algebra and Computation, 2015, 25(1-2): 123-167.

DOI：10.1142/S021819671540007X

• Finite graphs
• vertex independence
• rank of a finite graph
• boolean representation
• partial euclidean geometries
• Levi graph

A new notion of vertex independence and rank for a finite graph C 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.

• 出版日期2015-3