Graph with given automorphic group and given nuclear number

• Autores: Eduardo Montenegro
• Localización: Proyecciones: Journal of Mathematics, ISSN 0716-0917, ISSN-e 0717-6279, Vol. 11, Nº. 1, 1992, págs. 21-28
• Idioma: inglés
• DOI: 10.22199/S07160917.1992.0001.00004
• Enlaces
  • Texto completo
• Resumen

  • In 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 "

• Referencias bibliográficas
  • Citas [ 1] Chartrand, G. and Lesniak, L. Graphs and Digraphs, Wadsworth and Brooks/Cole Advanced Books and Software Pacific Grave, C.A....
  • [ 2] Frucht, R.: Herstellung von Graphen mit vorgegebener abstrakter Gruppe, Compositio Math., 6, 239-250, 1938.
  • [ 3] Montenegro, E.: Un resultado sobre el orden y el tamaño de grafos que representan a un grupo finito, Visiones Científicas, 2, 49-71,...
  • [ 4] Sabidussi, G.: Graphs with given group and given graph-theoretical properties, Canad. J. Math., 9, 515-525, 1957.