scientific article; zbMATH DE number 1264343

From MaRDI portal
Publication:4233266





A graph \(G\) has vertex set \(V(G)\) and edge set \(E(G)\). Graphs are finite, undirected, without loops and multiple edges. A vertex mapping is called a strong endomorphism if it preserves and reflects adjacency. They form a monoid denoted by \(\text{SEnd} (G)\). For \(N(a) = \{ b\in G\mid \{ a,b\}\in E(G)\}\), the neighbourhood relation \(\tau\) on \(V(G)\) is defined by the rule that for any \(a,b\in V(G)\), \((a,b)\in \tau\) if and only if \(N(a) = N(b)\). The factor graph of \(G\) with respect to \(\tau\) is denoted by \(G/\tau\). The main result is: Let \(G_1,G_2,\dots, G_n\) be \(n\) \((n\geq 2)\) connected graphs. Then \[ \text{SEnd} (G_1 \cup G_2\cup \cdots \cup G_n)= \text{SEnd} (G_1) + \text{SEnd} (G_2) + \cdots + \text{SEnd} (G_n) \] if and only if \(G_i/\tau\not\cong G_j/\tau\) for any \(i,j\in \{ 1,2, \dots, n\}\) with \(i\neq j\).











This page was built for publication:

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