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

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.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…