English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Suppose $X$ is a simple graph. The $X-$join $\Gamma$ of a set of complete or empty graphs $\{X_x \}_{x \in V(X)}$ is a simple graph with the following vertex and edge sets: \begin{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 $X-$join graph $\Gamma$ is called reduced if for vertices $x, y \in V(X)$, $x \ne y$, $N_X(x) \setminus \{ y\} = N_X(y) \setminus \{ x\}$ implies that $(i)$ if $xy \not\in E(X)$ then the graphs $X_x$ or $X_y$ are non-empty; $(ii)$ if $xy \in E(X)$ then $X_x$ or $X_y$ are not complete graphs. In this paper, we want to explore how the graph theoretical properties of $X-$join of graphs effect on its automorphism group. Among other results we compute the automorphism group of reduced complete-empty $X-$join of graphs.

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