On clique divergent graphs with linear growth

  title={On clique divergent graphs with linear growth},
  author={Francisco Larri{\'o}n and Victor Neumann-Lara},
  journal={Discret. Math.},
Simulating digital circuits with clique graphs
The clique operator transforms a graph G into its clique graph K(G), which is the intersection graph of all the (maximal) cliques of G. Clearly, we can iterate the operator to obtain iterated clique
The clique operator on graphs with few P4's
On expansive graphs
A new family of expansive graphs
The icosahedron is clique divergent
Contractibility and the clique graph operator
To any graph G we can associate a simplicial complex (G) whose simplices are the complete subgraphs of G, and thus we say that G is contractible whenever (G) is so. We study the relationship between


A Family of Clique Divergent Graphs with Linear Growth
We present an infinite set A of finite graphs such that for any graph G e A the order | V(kn(G))| of the n-th iterated clique graph kn(G) is a linear function of n. We also give examples of graphs G
Fixed points of posets and clique graphs
The fixed point property for partial orders has been the object of much attention in the past twenty years. Recently, M. Roddy ([7]) proved this famous conjecture of Rival (see [6]): the class of
Algorithmic graph theory and perfect graphs
Coloring a Family of Circular Arcs
This paper presents a collection of results about coloring a family of circular arcs. We prove that the strong perfect graph conjecture is valid for circular-arc graphs. We give some upper bounds on
Über iterierte Clique-Graphen
Clique divergence in graphs
  • in: Algebraic Methods in Graph Theory (Coll. Math. Soc. Janos Bolyai, 25) Szeged, North Holland
  • 1981
On clique-divergent graphs
  • in: ProblT emes Combinatoires et Th% eorie des Graphes (Colloques internationaux C.N.R.S, 260). Edition du CNRS, Paris
  • 1978