On the fixed number of graphs

MaRDI QIDQ4612204zbMATH OpenFDO

Authors Imran Javaid, M. Murtaza, Muhammad Asif, Farheen Iftikhar

Publication date 22 January 2019

Full work available at URL https://arxiv.org/abs/1507.00517, http://bims.iranjournals.ir/article_1103.html

zbMATH Keywords

fixed numberfixing numberfixing setstabilizer

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Abstract: An automorphism on a graph $G$ is a bijective mapping on the vertex set $V(G)$, which preserves the relation of adjacency between any two vertices of $G$. An automorphism $g$ fixes a vertex $v$ if $g$ maps $v$ onto itself. The stabilizer of a set $S$ of vertices is the set of all automorphisms that fix vertices of $S$. A set $F$ is called fixing set of $G$, if its stabilizer is trivial. The fixing number of a graph is the cardinality of a smallest fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph if its fixing number and fixed number are both $k$. In this paper, we study the fixed number of a graph and give construction of a graph of higher fixed number from graph with lower fixed number. We find bound on $k$ in terms of diameter $d$ of a distance-transitive $k$-fixed graph.

Recommendations

• Fixing numbers of graphs and groups
• On some parameters related to fixing sets in graphs
• On the fixatic number of graphs.
• On the fixing number of graphs with abelian automorphism group
• Destroying automorphisms by fixing nodes

Cited in

(8)

• On the fixing sets of dihedral groups
• On the Pfaffian number of graphs
• scientific article; zbMATH DE number 519999 (Why is no real title available?)
• scientific article; zbMATH DE number 1868509 (Why is no real title available?)
• On the fixatic number of graphs.
• On the plurality of graphs
• On some parameters related to fixing sets in graphs
• Automorphism related parameters of a graph assoclated to a finite vector space

This page was built for publication: On the fixed number of graphs

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