The Automorphism Group of the Reduced Complete-Empty X-Join of Graphs

From MaRDI portal
The Automorphism Group of the Reduced Complete-Empty $X-$Join of Graphs




Abstract: Suppose X is a simple graph. The Xjoin Gamma of a set of complete or empty graphs XxxinV(X) is a simple graph with the following vertex and edge sets: �egin{eqnarray*} V(Gamma) &=& {(x,y) | x in V(X) & y in V(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}. end{eqnarray*} The Xjoin graph Gamma is called reduced if for vertices x,yinV(X), xey, NX(x)setminusy=NX(y)setminusx implies that (i) if xyotinE(X) then the graphs Xx or Xy are non-empty; (ii) if xyinE(X) then Xx or Xy are not complete graphs. In this paper, we want to explore how the graph theoretical properties of Xjoin of graphs effect on its automorphism group. Among other results we compute the automorphism group of reduced complete-empty Xjoin of graphs.











This page was built for publication: The Automorphism Group of the Reduced Complete-Empty $X-$Join of Graphs

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