Pantheon Institutional repository
Collect, preserve and disseminate digital academic production in all areas of knowledge.
Comprise the assets of the repository, in addition to theses and dissertations at UFRJ, scientific articles, electronic books, book chapters and papers presented at events for teachers, researchers, administrative staff and students of master's and doctoral degrees.
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11422/2650| Type: | Relatório |
| Title: | On clique graphs with linear size |
| Author(s)/Inventor(s): | Protti, Fábio Szwarcfiter, Jayme Luiz |
| Abstract: | The clique graph H = K (G) of is the intersection graph of the collection of maximal cliques of G. In this case, G is a clique-inverse graph of H. By examining K (G), we describe some sufficient conditions for the number of maximal cliques of G to be bounded by O(|VG|). These conditions are then applied to analyze the complexity of recognizing clique-inverse graphs of various families of graphs. |
| Keywords: | Grafos clique-inverse Interseção de grafos Clique-inverse graphs Intersection graphs Clique graphs |
| Subject CNPq: | CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO |
| Production unit: | Instituto Tércio Pacitti de Aplicações e Pesquisas Computacionais |
| In: | Relatório Técnico NCE |
| Issue: | 0799 |
| Issue Date: | 31-Dec-1999 |
| Publisher country: | Brasil |
| Language: | eng |
| Right access: | Acesso Aberto |
| Citation: | PROTTI, F.; SZWARCFITER, J. L. On clique graphs with linear size . Rio de Janeiro: NCE, UFRJ, 1999. 10 p. (Relatório Técnico, 07/99) |
| Appears in Collections: | Relatórios |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 07_99_000611268.pdf | 210.62 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.