Read Full Article
JPRM-Vol. 1 (2018), Issue 1, pp. 01 – 12 Open Access Full-Text PDF
Imran Javaid, Muhammad Fazil, Usman Ali, Muhammad Salman.
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 in \(F\). In this paper, we introduce and study three new fixing parameters: fixing share, fixing polynomial and fixing value.