On The Fixatic Number of Graphs

MaRDI QIDQ6287055arXivFDO

Authors Muhammad Fazil, Imran Javaid

Publication date 24 May 2017

Published in arXiv

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

arXiv classification

math.CO

Abstract: The fixing number of a graph $G$ is the smallest cardinality of a set of vertices $FsubseteqV(G)$ such that only the trivial automorphism of $G$ fixes every vertex in $F$. Let $Pi$ $=$ $F_1,F_2,ldots,F_k$ be an ordered $k$-partition of $V(G)$. Then $Pi$ is called a {it fixatic partition} if for all $i$; $1leqileqk$, $F_i$ is a fixing set for $G$. The cardinality of a largest fixatic partition is called the {it fixatic number} of $G$. In this paper, we study the fixatic numbers of graphs. Sharp bounds for the fixatic number of graphs in general and exact values with specified conditions are given. Some realizable results are also given in this paper.

This page was built for publication: On The Fixatic Number of Graphs

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