No label defined (Q3978826)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 12944
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 12944 |
Statements
25 June 1992
0 references
triangle graph
0 references
0.7957601547241211
0 references
0.7431283593177795
0 references
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\).
0 references