On finding the number of graph automorphisms
This paper investigate the enumerability of the function #GA, the number of automorphisms of an undirected graph, in relation to the computational complexity of GI, the Graph Isomorphism problem. A function f (on graphs) is b(n)-enumerable if there exists a function g ¿ PF such that for all n-node g...
| Autores: | , , |
|---|---|
| Formato: | informe técnico |
| Fecha de publicación: | 1994 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/370819 |
| Acesso em linha: | https://hdl.handle.net/2117/370819 |
| Access Level: | acceso abierto |
| Palavra-chave: | Isomorphisms (Mathematics) Isomorfismes (Matemàtica) Àrees temàtiques de la UPC::Informàtica |
| Resumo: | This paper investigate the enumerability of the function #GA, the number of automorphisms of an undirected graph, in relation to the computational complexity of GI, the Graph Isomorphism problem. A function f (on graphs) is b(n)-enumerable if there exists a function g ¿ PF such that for all n-node graphs G, g(G) lists b(n) numbers, one of which is f(G). The results in this paper show the following connections between the enumerability of #GA and the Graph Isomorphism problem. |
|---|