Abstract:The fixing number of a graph G is the smallest cardinality of a set of vertices F ⊆ V (G) such that only the trivial automorphism of G fixes every vertex inThe cardinality of a largest fixatic partition is called the 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. N(u) − {v} = N(v) − {u}, then u and v are called twin ver… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.