Automorphism group and other properties of zero component graph over a vector space

DOI10.1155/2021/5595620MaRDI QIDQ2035704zbMATH OpenOpenAlexFDO

Authors Shikun Ou, Yanqi Fan, Qunfang Li

Publication date 25 June 2021

Published in Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2021/5595620

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Review text

Summary: In this paper, we introduce an undirected simple graph, called the zero component graph on finite-dimensional vector spaces. It is shown that two finite-dimensional vector spaces are isomorphic if and only if their zero component graphs are isomorphic, and any automorphism of a zero component graph can be uniquely decomposed into the product of a permutation automorphism and a regular automorphism. Moreover, we find the dominating number, as well as the independent number, and characterize the minimum independent dominating sets, maximum independent sets, and planarity of the graph. In the case that base fields are finite, we calculate the fixing number and metric dimension of the zero component graphs and determine vector spaces whose zero component graphs are Hamiltonian.

Recommendations

• Nonzero Component Graph of a Finite Dimensional Vector Space
• Non-zero component union graph of a finite-dimensional vector space
• On nonzero component graph of vector spaces over finite fields
• Automorphisms of the subspace sum graph on a vector space.
• The automorphism group and fixing number of orthogonality graph over a vector space

Cites work

• Automorphism group of the subspace inclusion graph of a vector space
• Automorphism related parameters of a graph assoclated to a finite vector space
• Base size, metric dimension and other invariants of groups and graphs
• Destroying automorphisms by fixing nodes
• Edge version of metric dimension and doubly resolving sets of the necklace graph
• Graph theory
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3353327 (Why is no real title available?)
• Identifying graph automorphisms using determining sets
• Non-zero component union graph of a finite-dimensional vector space
• Nonzero Component Graph of a Finite Dimensional Vector Space
• On metric dimensions of symmetric graphs obtained by rooted product
• On nonzero component graph of vector spaces over finite fields
• On resolvability of a graph associated to a finite vector space
• On the Metric Dimension of Cartesian Products of Graphs
• Orthogonal graphs of odd characteristic and their automorphisms
• Resolving sets for Johnson and Kneser graphs
• Subspace inclusion graph of a vector space
• Symplectic graphs and their automorphisms
• The structure and metric dimension of the power graph of a finite group

Cited in

(7)

• Domination numbers and automorphisms of dual graphs over vector spaces
• On the spectrum of linear dependence graph of a finite dimensional vector space
• The automorphism group and fixing number of orthogonality graph over a vector space
• Automorphisms and domination numbers of transformation graphs over vector spaces
• The automorphism group of nonzero component graph of vector space
• Domination sets and automorphism group of a graph associated to a finite vector space
• Automorphisms and independent number of single nonzero component graph over a vector space

This page was built for publication: Automorphism group and other properties of zero component graph over a vector space

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