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

Authors

  • Benish H.
  • Javaid I.
  • Murtaza M.

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 Ny 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. © 2019 Utilitas Mathematica Publishing Inc.. All rights reserved.

Published

2019-06-09

How to Cite

Benish H., Javaid I., & Murtaza M. (2019). Automorphism related parameters of a graph associated to a finite vector space. Utilitas Mathematica, 111. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/1404

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.