On the distinguishing number of functigraphs (Q2333653): Difference between revisions

Summary: Let \(G_1\) and \(G_2\) be disjoint copies of a graph \(G\) and \(g : V(G_1) \rightarrow V(G_2)\) be a function. A functigraph \(F_G\) consists of the vertex set \(V(G_1) \cup V(G_2)\) and the edge set \(E(G_1) \cup E(G_2) \cup \{u v : g(u) = v \}\). In this paper, we extend the study of distinguishing numbers of a graph to its functigraph. We discuss the behavior of distinguishing number in passing from \(G\) to \(F_G\) and find its sharp lower and upper bounds. We also discuss the distinguishing number of functigraphs of complete graphs and join graphs.