The difference between clique graphs and iterated clique graphs

dc.creatorde Caria, Pablo Jesús
dc.date2011-08
dc.identifierhttp://hdl.handle.net/11336/95071
dc.identifierde Caria, Pablo Jesús; The difference between clique graphs and iterated clique graphs; Elsevier; Electronic Notes in Discrete Mathematics; 37; 8-2011; 39-44
dc.identifier1571-0653
dc.identifierCONICET Digital
dc.identifierCONICET
dc.descriptionLet G be the class of all graphs and K the clique operator. The validity of the equality K(G)=K^2(G) has been an open question for several years. A graph in K(G) but not in K^2(G) is exhibited here.
dc.descriptionFil: de Caria, Pablo Jesús. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de La Plata; Argentina
dc.formatapplication/pdf
dc.formatapplication/pdf
dc.languageeng
dc.publisherElsevier
dc.relationinfo:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1571065311000096
dc.relationinfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.endm.2011.05.008
dc.rightsinfo:eu-repo/semantics/openAccess
dc.rightshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.subjectGRAPH THEORY
dc.subjectCLIQUE OPERATOR
dc.subjectCLIQUE GRAPH
dc.subjectOCTAHEDRAL GRAPH
dc.subjecthttps://purl.org/becyt/ford/1.1
dc.subjecthttps://purl.org/becyt/ford/1
dc.titleThe difference between clique graphs and iterated clique graphs
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:ar-repo/semantics/artículo
dc.typeinfo:eu-repo/semantics/publishedVersion


Este ítem pertenece a la siguiente institución