Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||On clique-complete graphs|
de Mello, CP
|Abstract:||The clique graph, K(G), of a graph G is the intersection graph of the maximal cliques of G. For a natural number n, a graph G is n-convergent if K-n(G) is isomorphic to ICI (the one-vertex graph). A graph G is convergent if it is n-convergent for some natural number n. A 2-convergent graph is called clique-complete. We describe the family of minimal graphs which are clique-complete but have no universal vertices. The minimality used here refers to induced subgraphs. In addition, we show that recognizing clique-complete graphs is Co-NP-complete.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.