Show simple item record

dc.creatorMontenegro, Eduardo
dc.date2018-04-02
dc.date.accessioned2019-06-28T17:06:16Z
dc.date.available2019-06-28T17:06:16Z
dc.identifierhttp://www.revistaproyecciones.cl/article/view/2598
dc.identifier10.22199/S07160917.1992.0001.00004
dc.identifier.urihttps://revistaschilenas.uchile.cl/handle/2250/100971
dc.descriptionIn 1938, Frucht proved that every finite group may be represented by a graph; in other words, given any finite group H, there is graph G whose automorphism group is isomorphic to H. Starting from this result a great many mathematicians have studied the following problem: "Given a finite group H and given a property P, is there a graph G that represents H and that satisfies the property P ?" The aim of this paper is to solve a problem of such characteristics. The statement we get is the following: "Every finite group H may be represented by a graph G whose nuclear number is n ≥ 2 , where n is a given positive integer "en-US
dc.formatapplication/pdf
dc.languageeng
dc.publisherUniversidad Católica del Norte.es-ES
dc.relationhttp://www.revistaproyecciones.cl/article/view/2598/2200
dc.rightsDerechos de autor 1992 Proyecciones. Journal of Mathematicses-ES
dc.rightshttps://creativecommons.org/licenses/by-nc/4.0/es-ES
dc.sourceProyecciones. Journal of Mathematics; Vol 11 No 1 (1992); 21-28en-US
dc.sourceProyecciones. Revista de Matemática; Vol. 11 Núm. 1 (1992); 21-28es-ES
dc.source0717-6279
dc.source0716-0917
dc.titleGraph with given automorphic group and given nuclear numberen-US
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.typeArtículo revisado por pareses-ES


This item appears in the following Collection(s)

Show simple item record