On second iterated clique graphs that are also third iterated clique graphs

Iterated clique graphs arise when the clique operator is applied to a graph more than once. Determining whether a graph is a clique graph or an iterated clique graph is usually a difficult task. The fact that being a clique graph and being an iterated clique graph are not equivalent things has been...

Descripción completa

Detalles Bibliográficos
Autores: de Caria, Pablo Jesús, Pizaña, Miguel A.
Tipo de recurso: artículo
Estado:Versión publicada
Fecha de publicación:2015
País:Argentina
Institución:Consejo Nacional de Investigaciones Científicas y Técnicas
Repositorio:CONICET Digital (CONICET)
Idioma:inglés
OAI Identifier:oai:ri.conicet.gov.ar:11336/55531
Acceso en línea:http://hdl.handle.net/11336/55531
Access Level:acceso abierto
Palabra clave:Clique Graph
Clique Operator
Iterated Clique Graph
Line Graph
https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
Descripción
Sumario:Iterated clique graphs arise when the clique operator is applied to a graph more than once. Determining whether a graph is a clique graph or an iterated clique graph is usually a difficult task. The fact that being a clique graph and being an iterated clique graph are not equivalent things has been proved recently. However, it is still unknown whether the classes of second iterated clique graphs and third iterated clique graphs are the same. In this work we find classes of graphs, defined by means of conditions on the clique size and the structure of the clique intersections, whose second iterated clique graphs are also third iterated clique graphs.