A new notion of vertex independence and rank for finite graphs
classification
🧮 math.CO
cs.DMmath.RT
keywords
independencerankbooleancolumnsfinitegraphindependentnotion
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.