Automorphism related parameters of a graph associated to a finite vector space

Abstract

In this paper, we discuss automorphism related parameters of a graph associated to a finite vector space. The fixing neighborhood of a pair (u,v) of vertices of a graph G is the set of all those vertices w of G, such that the orbits of u and v under the action of stabilizer of w are not equal. The fixed number of a graph is the minimum number k such that every subset of vertices of G of cardinality k is a fixing set of G. We study some properties of automorphisms of a graph associated to finite vector space and find the fixing neighborhood of pair of vertices of the graph. We also find the fixed number of the graph. It is shown that, for every positive integer N, there exists a graph G with fxd(G)-fix(G)≥ N, where fxd(G) is the fixed number and fix(G) is the fixing number of G.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…