Results on the intersection graphs of subspaces of a vector space
Combinatorics
2011-05-05 v1
Abstract
For a vector space the \emph{intersection graph of subspaces} of , denoted by , is the graph whose vertices are in a one-to-one correspondence with proper nontrivial subspaces of and two distinct vertices are adjacent if and only if the corresponding subspaces of 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.
Keywords
Cite
@article{arxiv.1105.0803,
title = {Results on the intersection graphs of subspaces of a vector space},
author = {N. Jafari Rad and S. H. Jafari},
journal= {arXiv preprint arXiv:1105.0803},
year = {2011}
}