Please use this identifier to cite or link to this item:
|Author(s):||Pedro V. Silva|
|Title:||A new notion of vertex independence and rank for finite graphs|
|Abstract:||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.|
|Scientific areas:||Ciências exactas e naturais::Matemática|
|Document Type:||Artigo em Revista Científica Internacional|
|Appears in Collections:||FCUP - Artigo em Revista Científica Internacional|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.