The difference between clique graphs and iterated clique graphs
Let G be the class of all graphs and K the clique operator. The validity of the equality K(G) = K²(G) has been an open question for several years. A graph in K(G) but not in K²(G) is exhibited here.
| Autor: | |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2011 |
| País: | Argentina |
| Recursos: | Universidad Nacional de La Plata |
| Repositorio: | SEDICI (UNLP) |
| Idioma: | inglés |
| OAI Identifier: | oai:sedici.unlp.edu.ar:10915/162534 |
| Acesso em linha: | http://sedici.unlp.edu.ar/handle/10915/162534 |
| Access Level: | acceso abierto |
| Palavra-chave: | Ciencias Exactas Matemática graph theory clique operator clique graph octahedral graph |
| Resumo: | Let G be the class of all graphs and K the clique operator. The validity of the equality K(G) = K²(G) has been an open question for several years. A graph in K(G) but not in K²(G) is exhibited here. |
|---|