A new notion of vertex independence and rank for finite graphs
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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2015
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10216/110901 |
| Country: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/110901 |
| Summary: | 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. |
|---|