The paper claims the automorphism group of a nonzero component graph is the symmetric group on the basis and derives distinguishing numbers, but the automorphism claim fails for q≥3 and the q=2 proof has a gap.
Results on the intersection graphs of subspaces of a vector space
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
For a vector space $V$ the \emph{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.
fields
math.CO 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Distinguishing Number of Non-Zero Component Graphs
The paper claims the automorphism group of a nonzero component graph is the symmetric group on the basis and derives distinguishing numbers, but the automorphism claim fails for q≥3 and the q=2 proof has a gap.