A new notion of vertex independence and rank for finite graphs

DOI10.1142/S021819671540007XzbMath1310.05163arXiv1201.3984OpenAlexW2964083902MaRDI QIDQ5246507

Pedro V. Silva, John L. Rhodes

Publication date: 21 April 2015

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3984

zbMATH Keywords

finite graphsLevi graphBoolean representationvertex independencepartial Euclidean geometriesrank of a finite graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Semirings (16Y60)

Related Items (1)

John Rhodes and the theory of finite semigroups.

Cites Work

• Primes, irreducibles and extremal lattices
• Lattice Theory: Foundation
• Graphs without four-cycles
• Introduction to Greedoids
• Continuous Lattices and Domains
• Self-dual configurations and regular graphs

This page was built for publication: A new notion of vertex independence and rank for finite graphs