Infinite -periodic graphs
Let \(\Phi\) be any graph-valued function (a simple example is the well-known function \({\mathcal L}: G\to {\mathcal L}G\) which arranges to every graph \(G\) its line graph \({\mathcal L}G\)). A graph \(G\) is \(\Phi\)-periodic if there is an integer \(p>0\) such that \(G\) and \(\Phi^pG\) are isomorphic. A graph \(G\) is \(\Phi\)-fixed if \(G\) and \(\Phi G\) are isomorphic. It is shown how to construct \(\Phi\)-periodic graphs provided the function \(\Phi\) fulfills certain axioms. A key to the given construction is a direct limit graph of the following sequence of graphs: \[ S: G_0\subseteq^{f_0}G_1\subseteq^{f_1}G_2\subseteq^{f_2} G_4\subseteq^{f_4}G_8\dots, \] where e.g. \(f_0\) denotes a monomorphism from \(G_0\) into \(G_1\) and analogous for the other functions \(f_1,f_2,f_4,\dots\). The author brings some applications of this construction. E.g.: For every \(k\)-line function \({\mathcal L}_k\) and every infinite cardinal number \(\aleph\) there is some \({\mathcal L}_k\)-fixed graph containing \(K_{\aleph}\). (The vertices of a \(k\)-line graph \({\mathcal L}_kG\) are complete subgraphs with \(k\) vertices in \(G\).) For every infinite cardinal number \(\aleph\) there is some \({\mathcal L}_3\)-fixed graph inside the class \(\Gamma_{\aleph}\) of graphs \(G\) with the following properties: (1) every edge lies in some \(K_{\aleph}\); (2) every clique has size at least 4; and (3) \({\mathcal L}_3G\) is connected. The construction is also applied to the \(k\)-path graph operator and to the Gallai graph operator.
- \(K_ i\)-covers. I: Complexity and polytopes
- A bibliography of graph equations
- A common generalization of line graphs and clique graphs
- An algorithm to recognize a middle graph
- Clique graphs and Helly graphs
- Duality and perfection for edges in cliques
- Edge-clique graphs
- Existence and structure of self-adjoint graphs
- Graphs isomorphic to subgraphs of their line-graphs
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 4043896 (Why is no real title available?)
- scientific article; zbMATH DE number 19192 (Why is no real title available?)
- scientific article; zbMATH DE number 12944 (Why is no real title available?)
- scientific article; zbMATH DE number 54781 (Why is no real title available?)
- scientific article; zbMATH DE number 146670 (Why is no real title available?)
- scientific article; zbMATH DE number 861395 (Why is no real title available?)
- scientific article; zbMATH DE number 975340 (Why is no real title available?)
- scientific article; zbMATH DE number 3275273 (Why is no real title available?)
- Iterated k-line graphs
- On the two‐edge‐colorings of perfect graphs
- Path graphs
- The dynamics of the line and path graph operators
- The interchange graph of a finite graph
- The Isomorphism between Graphs and their Adjoint Graphs
- The super line graph \({\mathfrak L}_2\)
- Traversability and connectivity of the middle graph of a graph
- Two classes of perfect graphs
- \(\omega\)-periodic graphs
- A note on periodicity of the 2-distance operator
- scientific article; zbMATH DE number 904966 (Why is no real title available?)
- scientific article; zbMATH DE number 1406901 (Why is no real title available?)
- scientific article; zbMATH DE number 7311628 (Why is no real title available?)
This page was built for publication: Infinite \(\Phi\)-periodic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1911989)