We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A new notion of vertex independence and rank for finite graphs.
- Authors
Rhodes, John; Silva, Pedro V.
- 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.
- Subjects
GEOMETRIC vertices; INDEPENDENCE (Mathematics); RANKING (Statistics); GRAPH theory; BOOLEAN functions; MATRICES (Mathematics)
- Publication
International Journal of Algebra & Computation, 2015, Vol 25, Issue 1/2, p123
- ISSN
0218-1967
- Publication type
Article
- DOI
10.1142/S021819671540007X