Distinguishing Number of Non-Zero Component Graphs

MaRDI QIDQ6323117zbMATH OpenFDO

Authors Imran Javaid, M. Murtaza, Hira Benish

Publication date 1 August 2019

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: A non-zero component graph $G(mathbbV)$ associated to a finite vector space $mathbbV$ is a graph whose vertices are non-zero vectors of $mathbbV$ and two vertices are adjacent, if their corresponding vectors have at least one non-zero component common in their linear combination of basis vectors. In this paper, we extend the study of properties of automorphisms of non-zero component graphs. We prove that every permutation of basis vectors can be extended to an automorphism of $G(mathbbV)$. We prove that the symmetric group of basis vectors of $mathbbV$ is isomorphic to the automorphism group of $G(mathbbV)$. We find the distinguishing number of the graph for both of the cases, when the number of field elements of vector space $mathbbV$ are 2 or more than 2.

This page was built for publication: Distinguishing Number of Non-Zero Component Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6323117)