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 language | English |
---|---|
Journal | Indian Journal of Pure and Applied Mathematics |
DOIs | |
Publication status | Accepted/In press - 2023 |
Keywords
- Automorphism
- Co-normal product of graphs
- Fixing set
ASJC Scopus subject areas
- General Mathematics
- Applied Mathematics