On automorphisms and fixing number of co-normal product of graphs

  • Shahid ur Rehman
  • , Muhammad Imran
  • , Imran Javaid

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

An automorphism of a graph describes its structural symmetry and the concept of fixing number of a graph is used for breaking its symmetries (except the trivial one). In this paper, we evaluate automorphisms of the co-normal product graph G1∗G2 of two simple graphs G1 and G2 and give sharp bounds on the order of its automorphism group. We study the fixing number of G1∗G2 and prove sharp bounds on it. Moreover, we compute the fixing number of the co-normal product of some families of graphs.

Original languageEnglish
Pages (from-to)1210-1221
Number of pages12
JournalIndian Journal of Pure and Applied Mathematics
Volume55
Issue number4
DOIs
Publication statusPublished - Dec 2024

Keywords

  • 05C25
  • 05C76
  • Automorphism
  • Co-normal product of graphs
  • Fixing set

ASJC Scopus subject areas

  • General Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'On automorphisms and fixing number of co-normal product of graphs'. Together they form a unique fingerprint.

Cite this