zbMATH — the first resource for mathematics

Convergence of iterated clique graphs. (English) Zbl 0766.05096
Let \(C(G)\) be the clique graph of a graph \(G\), and let \(C^ n(G)=C(C^{n-1}(G))\). The graph \(G\) is said to be clique-convergent to a set \(M=\{F,C(F),C^ 2(F),\dots,C^{p-1}(F)\}\) of graphs if \(C^ p(F)=F\) and \(C^ m(G)=F\) for some integer \(m\). Necessary conditions for a graph \(G\) to be clique-convergent are given in terms of simplicial complexes associated with \(G\) and \(F\). For some special classes of clique-convergent graphs the corresponding set \(M\) is determined exactly.

05C99 Graph theory
05C65 Hypergraphs
05C10 Planar graphs; geometric and topological aspects of graph theory
Full Text: DOI
[1] H.-J. Bandelt and E. Prisner, Clique graphs and Helly graphs, J. Combin. Theory Ser. B, to appear. · Zbl 0726.05060
[2] Dowker, C.H., Homology groups of relations, Ann. math., 56, 84-95, (1952) · Zbl 0046.40402
[3] Duchet, P.; Las Vergnas, M.; Meyneil, H., Connected cutsets of a graph and triangle bases of the cycle space, Discrete math., 62, 145-154, (1986) · Zbl 0609.05032
[4] Escalante, F., Über iterierte cliquen-graphen, (), 58-68 · Zbl 0266.05116
[5] Hedman, B., Clique graphs of time graphs, J. combin. theory ser. B, 37, 270-278, (1984) · Zbl 0547.05056
[6] Hilton, P.J.; Wylie, S., Homology theory, (1960), Cambridge University Press Cambridge · Zbl 0091.36306
[7] Lim, C.-K.; Peng, Y.-H., On graphs without multicliqual edges, J. graph theory, 5, 443-451, (1981) · Zbl 0492.05056
[8] Neumann-Lara, V., On clique-divergent graphs, Problémes combinatoires et thèorie des graphes, colloq. internat.CNRS, Vol. 260, 313-315, (1978), Paris · Zbl 0413.05058
[9] Neumann-Lara, V., Clique divergence in graphs, (), 563-569 · Zbl 0524.05050
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.