Domination in functigraphs

From MaRDI portal
Publication:4647871




Abstract: Let G1 and G2 be disjoint copies of a graph G, and let f:V(G1)ightarrowV(G2) be a function. Then a emph{functigraph} C(G,f)=(V,E) has the vertex set V=V(G1)cupV(G2) and the edge set E=E(G1)cupE(G2)cupuvmiduinV(G1),vinV(G2),v=f(u). A functigraph is a generalization of a emph{permutation graph} (also known as a emph{generalized prism}) in the sense of Chartrand and Harary. In this paper, we study domination in functigraphs. Let gamma(G) denote the domination number of G. It is readily seen that gamma(G)legamma(C(G,f))le2gamma(G). We investigate for graphs generally, and for cycles in great detail, the functions which achieve the upper and lower bounds, as well as the realization of the intermediate values.









This page was built for publication: Domination in functigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4647871)