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...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | article |
| Idioma: | eng |
| Publicado em: |
2015
|
| Assuntos: | |
| Texto completo: | https://hdl.handle.net/10216/110901 |
| País: | Portugal |
| Oai: | oai:repositorio-aberto.up.pt:10216/110901 |