scientific article; zbMATH DE number 12944

From MaRDI portal
Publication:3978826





Let \(G\) be a finite, undirected graph without loops and multiple edges. The triangle graph of \(G\), denoted by \(R(G)\), is defined as the graph the vertex set of which, \(V(R(G))\), is the set of all triangles of \(G\) and the edge set of which, \(E(R(G))\), is given by \[ E(R(G))=\{x_ 1x_ 2\mid x_ 1,x_ 2\in V(R(G)),\quad E(x_ 1)\cap E(x_ 2)\hbox { is nonempty}\}. \] Here \(E(x_ i)\) denotes the edge set of \(x_ i\) as a subgraph of \(G\). We define \(R^ 0(G)=G\) and \(R^ n(G)=R(R^{n-1}(G))\) for \(n\geq 1\). We determine graphs such that \(R^ n(G)\cong G\) for some positive integer \(n\).











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 Q3978826)