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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
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.