Results on the intersection graphs of subspaces of a vector space

2011/05/04 by Nader Jafari Rad, Sayyed Heidar Jafari, Rad, N. Jafari +1 · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Rings, Modules, and Algebras

paper · pdf · doi:10.48550/arxiv.1105.0803

openalex publication_date 2011/05/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

For a vector space V the intersection graph of subspaces of V, denoted by G(V), is the graph whose vertices are in a one-to-one correspondence with proper nontrivial subspaces of V and two distinct vertices are adjacent if and only if the corresponding subspaces of V have a nontrivial (nonzero) intersection. In this paper, we study the clique number, the chromatic number, the domination number and the independence number of the intersection graphs of subspaces of a vector space.

Cited by

• Subspace Sum Graph of a Vector Space

Related

• On Intersection Graphs of Graphs and Hypergraphs: A Survey
• Special Intersection Graph in The Topological Graphs
• Intersection graphs of segments and ∃ℝ
• On the linear intersection number of graphs
• The connection between the chromatic numbers of a hypergraph and its 1-intersection graph