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 is a simple graph. The join of a set of complete or empty graphs 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 join graph is called reduced if for vertices , , implies that if then the graphs or are non-empty; if then or are not complete graphs. In this paper, we want to explore how the graph theoretical properties of join of graphs effect on its automorphism group. Among other results we compute the automorphism group of reduced complete-empty join of graphs.
Recommendations
- The automorphism group of the complete expansion graph of a complete graph
- The automorphism group of finite graphs
- The group of an X-join of graphs
- On the automorphism groups of connected bipartite irreducible graphs
- Automorphism groups of some classes of graphs
- scientific article; zbMATH DE number 741504
- scientific article; zbMATH DE number 3851135
- scientific article; zbMATH DE number 1284167
- The automorphism group of a graphon
- On automorphism groups of graph truncations
Cited in
(3)
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)