On some parameters related to fixing sets in graphs

Authors

  • Imran Javaid Centre for advanced studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Pakistan.
  • Muhammad Fazil Centre for advanced studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Pakistan.
  • Usman Ali Centre for advanced studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Pakistan.
  • Muhammad Salman Centre for advanced studies in Pure and Applied Mathematics, Bahauddin Zakariya University Multan, Pakistan.

Keywords:

Fixing number, fixing share, fixing polynomial, fixing value

Abstract

The fixing number of a graph G is the smallest cardinality of a set of vertices F⊆V(G)F⊆V(G) such that only the trivial automorphism of GG fixes every vertex in FF. In this paper, we introduce and study three new fixing parameters: fixing share, fixing polynomial and fixing value.

Downloads

Download data is not yet available.

Downloads

Published

2018-12-31

Issue

Vol. 14 No. 1 (2018): Journal of Prime Research in Mathematics

Section

Regular

How to Cite

On some parameters related to fixing sets in graphs. (2018). Journal of Prime Research in Mathematics, 14(1), 01 – 12. https://jprm.sms.edu.pk/index.php/jprm/article/view/135