Let G1 and G2 be disjoint copies of a graph G, and let f : V (G1) → V (G2) be a function. Then a functigraph C(G, f) = (V,E) has the vertex set V = V (G1) ∪ V (G2) and the edge set E = E(G1) ∪ E(G2) ∪ {uv | u ∈ V (G1), v ∈ V (G2), v = f(u)}. A functigraph is a generalization of a permutation graph (also known as a generalized prism) in the sense of Chartrand and Harary. In this paper, we study ...