scientific article; zbMATH DE number 12944
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\).
- Iterated k-line graphs
- Triangle graphs
- Infinite \(\Phi\)-periodic graphs
- The total number of matchings in triangle graph of a connected graph.
- Induced cycles in triangle graphs
- scientific article; zbMATH DE number 3910412 (Why is no real title available?)
- Extended Learning Graphs for Triangle Finding
- scientific article; zbMATH DE number 1866931 (Why is no real title available?)
- scientific article; zbMATH DE number 894701 (Why is no real title available?)
- Triangles in inverse NSSD graphs
- On cycle graphs
- The edge-intersection graph of induced paths in a graph
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)