The problem of isomorphism of two graphs and counting the number of nonisomorphic graphs
| dc.contributor.author | DOUMI, Sara | |
| dc.date.accessioned | 2021-07-15T13:50:39Z | |
| dc.date.available | 2021-07-15T13:50:39Z | |
| dc.date.issued | 2021 | |
| dc.description.abstract | In this memory we have given some examples of isomorphic and non isomorphic graphs. Also, we have shown how to use the Polya enumeration theorem to count the number of non isomorphic graphs on n vertices. Since, if n=50 vertices in the graphs, then there is n!=50!=304109320171337804361260 8166064768844377641568960512000000000000 permutations to check if the graphs are isomorphic or not and this number is very large and we say that NP-hard problem. | en_US |
| dc.identifier.uri | https://repository.univ-msila.dz/handle/123456789/25049 | |
| dc.language.iso | en | en_US |
| dc.publisher | Faculty of Mathematics and Computer Science Department of Mathematics - Option : Algebra and Discrete Mathematics | en_US |
| dc.subject | Polya's theorem, permutation, isomorphic graphs, non isomorphic graphs. | en_US |
| dc.title | The problem of isomorphism of two graphs and counting the number of nonisomorphic graphs | en_US |
| dc.type | Thesis | en_US |