A new notion of vertex independence and rank for finite graphs

Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/110901

Full metadata record

DC Field	Value	Language
dc.creator	Pedro V. Silva
dc.creator	John Rhodes
dc.date.accessioned	2022-09-06T21:23:40Z	-
dc.date.available	2022-09-06T21:23:40Z	-
dc.date.issued	2015
dc.identifier.issn	0218-1967
dc.identifier.other	sigarra:214961
dc.identifier.uri	https://hdl.handle.net/10216/110901	-
dc.description.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.
dc.language.iso	eng
dc.rights	openAccess
dc.subject	Matemática, Matemática
dc.subject	Mathematics, Mathematics
dc.title	A new notion of vertex independence and rank for finite graphs
dc.type	Artigo em Revista Científica Internacional
dc.contributor.uporto	Faculdade de Ciências
dc.identifier.doi	10.1142/s021819671540007x
dc.identifier.authenticus	P-00A-AN0
dc.subject.fos	Ciências exactas e naturais::Matemática
dc.subject.fos	Natural sciences::Mathematics
Appears in Collections:	FCUP - Artigo em Revista Científica Internacional

Files in This Item:

File	Description	Size	Format
214961.pdf		416.35 kB	Adobe PDF	View/Open